./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-sp_file-44.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-sp_file-44.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 c4bbaaa17258129f6bb60f5a0d551610bd9b55c16f80d3fd4e62d867a6759bbe --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:38:54,797 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:38:54,868 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 06:38:54,873 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:38:54,875 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:38:54,906 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:38:54,907 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:38:54,908 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:38:54,909 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:38:54,909 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:38:54,910 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:38:54,910 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:38:54,911 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:38:54,913 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:38:54,913 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:38:54,914 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:38:54,914 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:38:54,914 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:38:54,914 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 06:38:54,915 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:38:54,915 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:38:54,918 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:38:54,919 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:38:54,919 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:38:54,919 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:38:54,920 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:38:54,920 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:38:54,920 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:38:54,920 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:38:54,921 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:38:54,921 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:38:54,921 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:38:54,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:38:54,922 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:38:54,922 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:38:54,922 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:38:54,922 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 06:38:54,923 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 06:38:54,923 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:38:54,923 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:38:54,923 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:38:54,925 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:38:54,925 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 -> c4bbaaa17258129f6bb60f5a0d551610bd9b55c16f80d3fd4e62d867a6759bbe [2024-10-13 06:38:55,240 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:38:55,265 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:38:55,269 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:38:55,270 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:38:55,271 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:38:55,272 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-44.i [2024-10-13 06:38:56,714 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:38:56,929 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:38:56,929 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-44.i [2024-10-13 06:38:56,939 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edc5257dc/de970281486e44819237ffb6d495451e/FLAG4975cdd2d [2024-10-13 06:38:57,296 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edc5257dc/de970281486e44819237ffb6d495451e [2024-10-13 06:38:57,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:38:57,300 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:38:57,302 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:38:57,302 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:38:57,308 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:38:57,309 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:38:57" (1/1) ... [2024-10-13 06:38:57,310 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@90e92f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:38:57, skipping insertion in model container [2024-10-13 06:38:57,310 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:38:57" (1/1) ... [2024-10-13 06:38:57,339 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:38:57,517 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-sp_file-44.i[917,930] [2024-10-13 06:38:57,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:38:57,597 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:38:57,615 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-sp_file-44.i[917,930] [2024-10-13 06:38:57,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:38:57,706 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:38:57,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:38:57 WrapperNode [2024-10-13 06:38:57,707 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:38:57,710 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:38:57,710 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:38:57,710 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:38:57,717 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:38:57" (1/1) ... [2024-10-13 06:38:57,732 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:38:57" (1/1) ... [2024-10-13 06:38:57,771 INFO L138 Inliner]: procedures = 29, calls = 164, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 498 [2024-10-13 06:38:57,772 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:38:57,772 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:38:57,773 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:38:57,773 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:38:57,784 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:38:57" (1/1) ... [2024-10-13 06:38:57,784 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:38:57" (1/1) ... [2024-10-13 06:38:57,794 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:38:57" (1/1) ... [2024-10-13 06:38:57,817 INFO L175 MemorySlicer]: Split 131 memory accesses to 2 slices as follows [2, 129]. 98 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 15]. The 17 writes are split as follows [0, 17]. [2024-10-13 06:38:57,817 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:38:57" (1/1) ... [2024-10-13 06:38:57,817 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:38:57" (1/1) ... [2024-10-13 06:38:57,835 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:38:57" (1/1) ... [2024-10-13 06:38:57,842 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:38:57" (1/1) ... [2024-10-13 06:38:57,847 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:38:57" (1/1) ... [2024-10-13 06:38:57,850 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:38:57" (1/1) ... [2024-10-13 06:38:57,855 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:38:57,857 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:38:57,857 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:38:57,857 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:38:57,858 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:38:57" (1/1) ... [2024-10-13 06:38:57,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:38:57,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:38:57,894 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:38:57,898 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:38:57,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:38:57,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-13 06:38:57,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-13 06:38:57,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 06:38:57,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 06:38:57,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-13 06:38:57,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-13 06:38:57,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 06:38:57,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 06:38:57,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-13 06:38:57,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-13 06:38:57,951 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:38:57,951 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:38:57,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 06:38:57,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 06:38:57,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:38:57,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:38:58,095 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:38:58,097 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:38:58,715 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2024-10-13 06:38:58,715 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:38:58,756 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:38:58,757 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:38:58,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:38:58 BoogieIcfgContainer [2024-10-13 06:38:58,757 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:38:58,760 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:38:58,760 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:38:58,764 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:38:58,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:38:57" (1/3) ... [2024-10-13 06:38:58,765 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3be7df94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:38:58, skipping insertion in model container [2024-10-13 06:38:58,765 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:38:57" (2/3) ... [2024-10-13 06:38:58,766 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3be7df94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:38:58, skipping insertion in model container [2024-10-13 06:38:58,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:38:58" (3/3) ... [2024-10-13 06:38:58,767 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-44.i [2024-10-13 06:38:58,780 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:38:58,781 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:38:58,842 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:38:58,850 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;@7af7b49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:38:58,850 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:38:58,855 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 87 states have (on average 1.4137931034482758) internal successors, (123), 88 states have internal predecessors, (123), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 06:38:58,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-13 06:38:58,870 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:38:58,872 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:58,873 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:38:58,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:38:58,881 INFO L85 PathProgramCache]: Analyzing trace with hash 2021842608, now seen corresponding path program 1 times [2024-10-13 06:38:58,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:38:58,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182871663] [2024-10-13 06:38:58,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:38:58,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:38:59,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:59,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:38:59,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:59,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:38:59,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:59,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:38:59,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:59,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:38:59,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:59,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:38:59,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:59,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:38:59,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:59,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:38:59,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:59,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:38:59,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:59,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:38:59,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:59,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:38:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:59,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:38:59,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:59,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:38:59,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:59,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:38:59,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:59,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:38:59,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:59,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:38:59,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:59,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:38:59,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:59,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:38:59,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:59,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 06:38:59,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:59,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:38:59,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:59,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:38:59,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:59,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:38:59,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:59,375 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:38:59,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:38:59,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182871663] [2024-10-13 06:38:59,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182871663] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:38:59,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:38:59,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:38:59,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124518313] [2024-10-13 06:38:59,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:38:59,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:38:59,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:38:59,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:38:59,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:38:59,453 INFO L87 Difference]: Start difference. First operand has 111 states, 87 states have (on average 1.4137931034482758) internal successors, (123), 88 states have internal predecessors, (123), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 06:38:59,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:38:59,509 INFO L93 Difference]: Finished difference Result 219 states and 349 transitions. [2024-10-13 06:38:59,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:38:59,512 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 154 [2024-10-13 06:38:59,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:38:59,524 INFO L225 Difference]: With dead ends: 219 [2024-10-13 06:38:59,525 INFO L226 Difference]: Without dead ends: 109 [2024-10-13 06:38:59,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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:38:59,535 INFO L432 NwaCegarLoop]: 156 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, 156 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:38:59,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:38:59,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-13 06:38:59,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-10-13 06:38:59,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 86 states have (on average 1.372093023255814) internal successors, (118), 86 states have internal predecessors, (118), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 06:38:59,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 160 transitions. [2024-10-13 06:38:59,607 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 160 transitions. Word has length 154 [2024-10-13 06:38:59,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:38:59,607 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 160 transitions. [2024-10-13 06:38:59,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 06:38:59,609 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 160 transitions. [2024-10-13 06:38:59,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-13 06:38:59,614 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:38:59,615 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:59,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 06:38:59,616 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:38:59,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:38:59,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1763814434, now seen corresponding path program 1 times [2024-10-13 06:38:59,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:38:59,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733530006] [2024-10-13 06:38:59,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:38:59,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:38:59,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:38:59,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:38:59,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:00,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:39:00,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:00,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:39:00,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:00,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:39:00,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:00,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:39:00,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:00,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:39:00,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:00,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:39:00,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:00,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:39:00,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:00,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:39:00,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:00,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:39:00,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:00,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:39:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:00,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:39:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:00,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:39:00,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:00,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:39:00,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:00,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:39:00,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:00,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:39:00,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:00,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:39:00,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:00,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 06:39:00,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:00,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:39:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:00,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:39:00,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:00,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:39:00,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:00,068 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:39:00,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:39:00,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733530006] [2024-10-13 06:39:00,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733530006] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:39:00,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:39:00,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:39:00,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026041067] [2024-10-13 06:39:00,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:39:00,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:39:00,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:39:00,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:39:00,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:39:00,073 INFO L87 Difference]: Start difference. First operand 109 states and 160 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:39:00,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:39:00,147 INFO L93 Difference]: Finished difference Result 220 states and 323 transitions. [2024-10-13 06:39:00,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:39:00,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 154 [2024-10-13 06:39:00,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:39:00,154 INFO L225 Difference]: With dead ends: 220 [2024-10-13 06:39:00,155 INFO L226 Difference]: Without dead ends: 112 [2024-10-13 06:39:00,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 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:39:00,157 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 1 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:39:00,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 455 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:39:00,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-13 06:39:00,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2024-10-13 06:39:00,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 88 states have (on average 1.3636363636363635) internal successors, (120), 88 states have internal predecessors, (120), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 06:39:00,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 162 transitions. [2024-10-13 06:39:00,184 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 162 transitions. Word has length 154 [2024-10-13 06:39:00,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:39:00,188 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 162 transitions. [2024-10-13 06:39:00,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:39:00,189 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 162 transitions. [2024-10-13 06:39:00,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-13 06:39:00,193 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:39:00,194 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:00,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 06:39:00,194 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:39:00,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:39:00,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1763874016, now seen corresponding path program 1 times [2024-10-13 06:39:00,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:39:00,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199049834] [2024-10-13 06:39:00,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:39:00,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:39:00,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:01,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:39:01,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:01,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:39:01,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:01,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:39:01,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:01,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:39:01,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:01,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:39:01,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:01,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:39:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:01,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:39:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:01,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:39:01,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:01,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:39:01,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:01,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:39:01,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:01,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:39:01,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:01,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:39:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:01,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:39:01,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:01,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:39:01,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:01,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:39:01,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:01,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:39:01,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:01,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:39:01,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:01,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 06:39:01,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:01,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:39:01,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:01,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:39:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:01,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:39:01,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:01,594 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:39:01,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:39:01,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199049834] [2024-10-13 06:39:01,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199049834] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:39:01,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:39:01,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 06:39:01,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162221034] [2024-10-13 06:39:01,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:39:01,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 06:39:01,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:39:01,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 06:39:01,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:39:01,603 INFO L87 Difference]: Start difference. First operand 111 states and 162 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 06:39:02,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:39:02,126 INFO L93 Difference]: Finished difference Result 273 states and 398 transitions. [2024-10-13 06:39:02,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:39:02,128 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 154 [2024-10-13 06:39:02,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:39:02,130 INFO L225 Difference]: With dead ends: 273 [2024-10-13 06:39:02,130 INFO L226 Difference]: Without dead ends: 163 [2024-10-13 06:39:02,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-10-13 06:39:02,135 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 351 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:39:02,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 374 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 06:39:02,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-13 06:39:02,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 123. [2024-10-13 06:39:02,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 100 states have (on average 1.38) internal successors, (138), 100 states have internal predecessors, (138), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 06:39:02,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 180 transitions. [2024-10-13 06:39:02,164 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 180 transitions. Word has length 154 [2024-10-13 06:39:02,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:39:02,164 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 180 transitions. [2024-10-13 06:39:02,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 06:39:02,165 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 180 transitions. [2024-10-13 06:39:02,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-13 06:39:02,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:39:02,167 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:02,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 06:39:02,168 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:39:02,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:39:02,168 INFO L85 PathProgramCache]: Analyzing trace with hash 2113558178, now seen corresponding path program 1 times [2024-10-13 06:39:02,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:39:02,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734648325] [2024-10-13 06:39:02,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:39:02,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:39:02,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:04,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:39:04,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:04,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:39:04,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:05,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:39:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:05,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:39:05,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:05,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:39:05,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:05,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:39:05,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:05,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:39:05,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:05,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:39:05,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:05,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:39:05,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:05,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:39:05,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:05,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:39:05,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:05,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:39:05,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:05,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:39:05,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:05,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:39:05,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:05,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:39:05,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:05,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:39:05,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:05,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:39:05,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:05,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 06:39:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:05,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:39:05,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:05,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:39:05,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:05,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:39:05,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:05,195 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:39:05,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:39:05,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734648325] [2024-10-13 06:39:05,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734648325] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:39:05,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:39:05,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 06:39:05,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652056811] [2024-10-13 06:39:05,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:39:05,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 06:39:05,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:39:05,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 06:39:05,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:39:05,199 INFO L87 Difference]: Start difference. First operand 123 states and 180 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 06:39:06,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:39:06,013 INFO L93 Difference]: Finished difference Result 291 states and 425 transitions. [2024-10-13 06:39:06,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:39:06,014 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 155 [2024-10-13 06:39:06,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:39:06,017 INFO L225 Difference]: With dead ends: 291 [2024-10-13 06:39:06,017 INFO L226 Difference]: Without dead ends: 169 [2024-10-13 06:39:06,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-10-13 06:39:06,024 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 241 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 06:39:06,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 476 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 06:39:06,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-13 06:39:06,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 129. [2024-10-13 06:39:06,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 106 states have (on average 1.3867924528301887) internal successors, (147), 106 states have internal predecessors, (147), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 06:39:06,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 189 transitions. [2024-10-13 06:39:06,060 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 189 transitions. Word has length 155 [2024-10-13 06:39:06,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:39:06,061 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 189 transitions. [2024-10-13 06:39:06,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 06:39:06,062 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 189 transitions. [2024-10-13 06:39:06,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-13 06:39:06,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:39:06,064 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:06,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 06:39:06,064 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:39:06,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:39:06,065 INFO L85 PathProgramCache]: Analyzing trace with hash 640458919, now seen corresponding path program 1 times [2024-10-13 06:39:06,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:39:06,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173195380] [2024-10-13 06:39:06,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:39:06,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:39:06,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:06,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:39:06,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:06,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:39:06,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:06,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:39:06,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:06,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:39:06,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:06,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:39:06,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:06,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:39:06,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:06,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:39:06,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:06,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:39:06,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:06,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:39:06,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:06,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:39:06,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:06,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:39:06,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:06,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:39:06,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:06,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:39:06,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:06,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:39:06,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:06,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:39:06,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:06,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:39:06,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:06,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:39:06,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:06,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 06:39:06,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:06,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:39:06,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:06,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:39:06,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:06,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:39:06,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:06,263 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:39:06,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:39:06,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173195380] [2024-10-13 06:39:06,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173195380] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:39:06,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:39:06,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:39:06,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531143413] [2024-10-13 06:39:06,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:39:06,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:39:06,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:39:06,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:39:06,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:39:06,266 INFO L87 Difference]: Start difference. First operand 129 states and 189 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:39:06,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:39:06,371 INFO L93 Difference]: Finished difference Result 260 states and 380 transitions. [2024-10-13 06:39:06,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:39:06,372 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 155 [2024-10-13 06:39:06,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:39:06,373 INFO L225 Difference]: With dead ends: 260 [2024-10-13 06:39:06,374 INFO L226 Difference]: Without dead ends: 132 [2024-10-13 06:39:06,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:39:06,375 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 2 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:39:06,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 405 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:39:06,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-13 06:39:06,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 129. [2024-10-13 06:39:06,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 106 states have (on average 1.3584905660377358) internal successors, (144), 106 states have internal predecessors, (144), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 06:39:06,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 186 transitions. [2024-10-13 06:39:06,403 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 186 transitions. Word has length 155 [2024-10-13 06:39:06,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:39:06,404 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 186 transitions. [2024-10-13 06:39:06,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:39:06,405 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 186 transitions. [2024-10-13 06:39:06,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-13 06:39:06,408 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:39:06,408 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:06,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 06:39:06,408 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:39:06,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:39:06,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1505295435, now seen corresponding path program 1 times [2024-10-13 06:39:06,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:39:06,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935835179] [2024-10-13 06:39:06,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:39:06,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:39:06,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:06,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:39:06,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:06,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:39:06,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:06,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:39:06,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:06,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:39:06,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:06,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:39:06,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:06,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:39:06,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:06,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:39:06,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:06,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:39:06,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:06,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:39:06,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:06,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:39:06,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:06,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:39:06,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:06,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:39:06,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:06,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:39:06,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:06,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:39:06,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:06,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:39:06,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:06,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:39:06,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:06,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:39:06,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:06,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 06:39:06,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:06,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:39:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:06,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:39:06,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:06,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:39:06,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:06,655 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:39:06,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:39:06,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935835179] [2024-10-13 06:39:06,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935835179] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:39:06,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:39:06,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:39:06,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042011765] [2024-10-13 06:39:06,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:39:06,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:39:06,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:39:06,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:39:06,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:39:06,658 INFO L87 Difference]: Start difference. First operand 129 states and 186 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:39:06,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:39:06,714 INFO L93 Difference]: Finished difference Result 260 states and 375 transitions. [2024-10-13 06:39:06,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:39:06,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 156 [2024-10-13 06:39:06,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:39:06,717 INFO L225 Difference]: With dead ends: 260 [2024-10-13 06:39:06,717 INFO L226 Difference]: Without dead ends: 132 [2024-10-13 06:39:06,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:39:06,721 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:39:06,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 597 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:39:06,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-13 06:39:06,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-10-13 06:39:06,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 109 states have (on average 1.348623853211009) internal successors, (147), 109 states have internal predecessors, (147), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 06:39:06,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 189 transitions. [2024-10-13 06:39:06,751 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 189 transitions. Word has length 156 [2024-10-13 06:39:06,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:39:06,752 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 189 transitions. [2024-10-13 06:39:06,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:39:06,753 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 189 transitions. [2024-10-13 06:39:06,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-13 06:39:06,756 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:39:06,756 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:06,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 06:39:06,757 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:39:06,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:39:06,757 INFO L85 PathProgramCache]: Analyzing trace with hash 713665066, now seen corresponding path program 1 times [2024-10-13 06:39:06,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:39:06,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364220033] [2024-10-13 06:39:06,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:39:06,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:39:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:07,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:39:07,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:07,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:39:07,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:07,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:39:07,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:07,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:39:07,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:07,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:39:07,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:07,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:39:07,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:07,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:39:07,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:07,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:39:07,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:07,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:39:07,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:07,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:39:07,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:07,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:39:07,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:07,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:39:07,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:07,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:39:07,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:07,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:39:07,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:07,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:39:07,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:07,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:39:07,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:07,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:39:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:07,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 06:39:07,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:07,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:39:07,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:07,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:39:07,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:07,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:39:07,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:07,982 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:39:07,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:39:07,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364220033] [2024-10-13 06:39:07,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364220033] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:39:07,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:39:07,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 06:39:07,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914387068] [2024-10-13 06:39:07,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:39:07,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 06:39:07,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:39:07,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 06:39:07,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:39:07,985 INFO L87 Difference]: Start difference. First operand 132 states and 189 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 06:39:08,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:39:08,483 INFO L93 Difference]: Finished difference Result 310 states and 442 transitions. [2024-10-13 06:39:08,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:39:08,484 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 156 [2024-10-13 06:39:08,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:39:08,486 INFO L225 Difference]: With dead ends: 310 [2024-10-13 06:39:08,486 INFO L226 Difference]: Without dead ends: 179 [2024-10-13 06:39:08,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-10-13 06:39:08,488 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 386 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:39:08,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 339 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 06:39:08,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-10-13 06:39:08,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 132. [2024-10-13 06:39:08,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 109 states have (on average 1.348623853211009) internal successors, (147), 109 states have internal predecessors, (147), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 06:39:08,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 189 transitions. [2024-10-13 06:39:08,509 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 189 transitions. Word has length 156 [2024-10-13 06:39:08,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:39:08,509 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 189 transitions. [2024-10-13 06:39:08,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 06:39:08,510 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 189 transitions. [2024-10-13 06:39:08,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-13 06:39:08,512 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:39:08,512 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:08,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 06:39:08,513 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:39:08,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:39:08,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1752695660, now seen corresponding path program 1 times [2024-10-13 06:39:08,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:39:08,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590183999] [2024-10-13 06:39:08,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:39:08,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:39:08,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:11,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:39:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:11,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:39:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:11,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:39:11,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:11,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:39:11,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:11,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:39:11,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:11,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:39:11,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:11,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:39:11,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:11,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:39:11,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:11,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:39:11,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:11,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:39:11,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:11,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:39:11,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:11,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:39:11,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:11,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:39:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:11,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:39:11,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:11,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:39:11,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:11,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:39:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:12,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:39:12,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:12,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 06:39:12,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:12,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:39:12,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:12,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:39:12,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:12,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:39:12,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:12,066 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:39:12,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:39:12,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590183999] [2024-10-13 06:39:12,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590183999] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:39:12,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:39:12,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-13 06:39:12,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91686364] [2024-10-13 06:39:12,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:39:12,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 06:39:12,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:39:12,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 06:39:12,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-10-13 06:39:12,069 INFO L87 Difference]: Start difference. First operand 132 states and 189 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 06:39:13,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:39:13,080 INFO L93 Difference]: Finished difference Result 308 states and 439 transitions. [2024-10-13 06:39:13,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:39:13,081 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 157 [2024-10-13 06:39:13,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:39:13,083 INFO L225 Difference]: With dead ends: 308 [2024-10-13 06:39:13,083 INFO L226 Difference]: Without dead ends: 177 [2024-10-13 06:39:13,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2024-10-13 06:39:13,084 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 356 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 06:39:13,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 560 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 06:39:13,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-10-13 06:39:13,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 132. [2024-10-13 06:39:13,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 109 states have (on average 1.348623853211009) internal successors, (147), 109 states have internal predecessors, (147), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 06:39:13,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 189 transitions. [2024-10-13 06:39:13,109 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 189 transitions. Word has length 157 [2024-10-13 06:39:13,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:39:13,109 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 189 transitions. [2024-10-13 06:39:13,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 06:39:13,110 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 189 transitions. [2024-10-13 06:39:13,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-13 06:39:13,111 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:39:13,112 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:13,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 06:39:13,112 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:39:13,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:39:13,113 INFO L85 PathProgramCache]: Analyzing trace with hash -2106674680, now seen corresponding path program 1 times [2024-10-13 06:39:13,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:39:13,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135440347] [2024-10-13 06:39:13,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:39:13,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:39:13,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:15,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:39:15,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:15,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:39:15,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:15,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:39:15,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:15,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:39:15,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:15,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:39:15,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:15,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:39:15,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:15,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:39:15,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:15,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:39:15,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:15,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:39:15,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:15,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:39:15,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:15,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:39:15,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:15,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:39:15,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:15,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:39:15,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:15,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:39:15,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:15,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:39:15,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:15,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:39:15,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:15,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:39:15,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:15,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 06:39:15,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:15,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:39:15,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:15,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:39:15,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:15,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:39:15,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:15,709 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:39:15,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:39:15,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135440347] [2024-10-13 06:39:15,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135440347] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:39:15,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:39:15,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 06:39:15,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249934142] [2024-10-13 06:39:15,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:39:15,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 06:39:15,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:39:15,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 06:39:15,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:39:15,713 INFO L87 Difference]: Start difference. First operand 132 states and 189 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 06:39:16,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:39:16,341 INFO L93 Difference]: Finished difference Result 304 states and 432 transitions. [2024-10-13 06:39:16,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:39:16,341 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 158 [2024-10-13 06:39:16,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:39:16,344 INFO L225 Difference]: With dead ends: 304 [2024-10-13 06:39:16,344 INFO L226 Difference]: Without dead ends: 173 [2024-10-13 06:39:16,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-10-13 06:39:16,345 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 284 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:39:16,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 321 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 06:39:16,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-10-13 06:39:16,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 134. [2024-10-13 06:39:16,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 111 states have (on average 1.3423423423423424) internal successors, (149), 111 states have internal predecessors, (149), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 06:39:16,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 191 transitions. [2024-10-13 06:39:16,369 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 191 transitions. Word has length 158 [2024-10-13 06:39:16,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:39:16,371 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 191 transitions. [2024-10-13 06:39:16,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 06:39:16,372 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 191 transitions. [2024-10-13 06:39:16,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-13 06:39:16,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:39:16,375 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:16,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 06:39:16,376 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:39:16,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:39:16,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1468174384, now seen corresponding path program 1 times [2024-10-13 06:39:16,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:39:16,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851047353] [2024-10-13 06:39:16,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:39:16,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:39:16,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:16,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:39:16,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:16,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:39:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:16,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:39:16,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:16,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:39:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:16,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:39:16,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:16,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:39:16,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:16,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:39:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:16,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:39:16,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:16,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:39:16,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:16,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:39:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:16,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:39:16,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:16,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:39:16,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:16,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:39:16,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:16,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:39:16,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:16,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:39:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:16,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:39:16,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:16,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:39:16,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:16,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 06:39:16,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:16,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:39:16,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:16,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:39:16,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:16,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:39:16,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:16,551 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:39:16,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:39:16,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851047353] [2024-10-13 06:39:16,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851047353] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:39:16,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:39:16,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 06:39:16,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805565909] [2024-10-13 06:39:16,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:39:16,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 06:39:16,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:39:16,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 06:39:16,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:39:16,555 INFO L87 Difference]: Start difference. First operand 134 states and 191 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:39:16,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:39:16,586 INFO L93 Difference]: Finished difference Result 267 states and 381 transitions. [2024-10-13 06:39:16,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 06:39:16,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 158 [2024-10-13 06:39:16,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:39:16,588 INFO L225 Difference]: With dead ends: 267 [2024-10-13 06:39:16,588 INFO L226 Difference]: Without dead ends: 134 [2024-10-13 06:39:16,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:39:16,589 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:39:16,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 304 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:39:16,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-13 06:39:16,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-10-13 06:39:16,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 111 states have (on average 1.3333333333333333) internal successors, (148), 111 states have internal predecessors, (148), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 06:39:16,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 190 transitions. [2024-10-13 06:39:16,612 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 190 transitions. Word has length 158 [2024-10-13 06:39:16,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:39:16,612 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 190 transitions. [2024-10-13 06:39:16,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:39:16,613 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 190 transitions. [2024-10-13 06:39:16,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-13 06:39:16,616 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:39:16,616 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:16,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 06:39:16,616 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:39:16,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:39:16,617 INFO L85 PathProgramCache]: Analyzing trace with hash -238885752, now seen corresponding path program 1 times [2024-10-13 06:39:16,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:39:16,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159263819] [2024-10-13 06:39:16,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:39:16,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:39:16,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:16,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:39:16,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:16,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:39:16,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:16,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:39:16,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:16,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:39:16,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:16,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:39:16,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:16,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:39:16,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:16,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:39:16,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:16,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:39:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:16,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:39:16,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:16,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:39:16,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:16,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:39:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:16,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:39:16,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:16,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:39:16,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:16,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:39:16,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:16,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:39:16,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:16,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:39:16,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:16,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:39:16,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:16,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 06:39:16,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:16,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:39:16,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:16,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:39:16,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:16,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:39:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:16,915 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:39:16,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:39:16,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159263819] [2024-10-13 06:39:16,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159263819] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:39:16,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:39:16,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:39:16,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921950445] [2024-10-13 06:39:16,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:39:16,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:39:16,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:39:16,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:39:16,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:39:16,917 INFO L87 Difference]: Start difference. First operand 134 states and 190 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:39:17,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:39:17,067 INFO L93 Difference]: Finished difference Result 311 states and 438 transitions. [2024-10-13 06:39:17,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:39:17,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 158 [2024-10-13 06:39:17,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:39:17,070 INFO L225 Difference]: With dead ends: 311 [2024-10-13 06:39:17,070 INFO L226 Difference]: Without dead ends: 178 [2024-10-13 06:39:17,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 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:39:17,071 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 50 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:39:17,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 646 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:39:17,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-10-13 06:39:17,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 137. [2024-10-13 06:39:17,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 114 states have (on average 1.3245614035087718) internal successors, (151), 114 states have internal predecessors, (151), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 06:39:17,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 193 transitions. [2024-10-13 06:39:17,110 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 193 transitions. Word has length 158 [2024-10-13 06:39:17,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:39:17,110 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 193 transitions. [2024-10-13 06:39:17,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 06:39:17,111 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 193 transitions. [2024-10-13 06:39:17,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-13 06:39:17,113 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:39:17,113 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:17,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 06:39:17,113 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:39:17,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:39:17,114 INFO L85 PathProgramCache]: Analyzing trace with hash -30686518, now seen corresponding path program 1 times [2024-10-13 06:39:17,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:39:17,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972772792] [2024-10-13 06:39:17,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:39:17,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:39:17,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:19,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:39:19,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:19,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:39:19,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:19,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:39:19,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:19,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:39:19,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:19,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:39:19,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:19,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:39:19,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:19,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:39:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:19,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:39:19,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:19,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:39:19,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:19,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:39:19,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:19,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:39:19,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:19,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:39:19,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:19,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:39:19,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:19,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:39:19,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:19,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:39:19,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:19,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:39:19,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:19,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:39:19,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:19,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 06:39:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:19,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:39:19,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:19,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:39:19,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:19,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:39:19,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:19,262 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:39:19,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:39:19,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972772792] [2024-10-13 06:39:19,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972772792] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:39:19,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:39:19,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 06:39:19,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481914940] [2024-10-13 06:39:19,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:39:19,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 06:39:19,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:39:19,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 06:39:19,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:39:19,265 INFO L87 Difference]: Start difference. First operand 137 states and 193 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 06:39:19,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:39:19,819 INFO L93 Difference]: Finished difference Result 342 states and 479 transitions. [2024-10-13 06:39:19,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:39:19,822 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 159 [2024-10-13 06:39:19,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:39:19,824 INFO L225 Difference]: With dead ends: 342 [2024-10-13 06:39:19,824 INFO L226 Difference]: Without dead ends: 206 [2024-10-13 06:39:19,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-10-13 06:39:19,827 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 307 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:39:19,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 306 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 06:39:19,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-10-13 06:39:19,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 151. [2024-10-13 06:39:19,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 128 states have (on average 1.3359375) internal successors, (171), 128 states have internal predecessors, (171), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 06:39:19,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 213 transitions. [2024-10-13 06:39:19,848 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 213 transitions. Word has length 159 [2024-10-13 06:39:19,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:39:19,848 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 213 transitions. [2024-10-13 06:39:19,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 06:39:19,849 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 213 transitions. [2024-10-13 06:39:19,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-13 06:39:19,851 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:39:19,851 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:19,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 06:39:19,852 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:39:19,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:39:19,852 INFO L85 PathProgramCache]: Analyzing trace with hash -617492532, now seen corresponding path program 1 times [2024-10-13 06:39:19,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:39:19,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969139914] [2024-10-13 06:39:19,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:39:19,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:39:19,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:21,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:39:21,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:21,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:39:21,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:21,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:39:21,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:21,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:39:21,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:21,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:39:21,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:21,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:39:21,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:21,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:39:21,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:21,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:39:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:21,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:39:21,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:21,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:39:21,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:21,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:39:21,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:21,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:39:21,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:21,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:39:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:21,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:39:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:21,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:39:21,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:21,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:39:21,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:21,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:39:21,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:21,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 06:39:21,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:21,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:39:21,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:21,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:39:21,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:21,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:39:21,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:21,345 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:39:21,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:39:21,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969139914] [2024-10-13 06:39:21,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969139914] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:39:21,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:39:21,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 06:39:21,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243130551] [2024-10-13 06:39:21,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:39:21,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 06:39:21,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:39:21,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 06:39:21,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:39:21,347 INFO L87 Difference]: Start difference. First operand 151 states and 213 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 06:39:21,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:39:21,658 INFO L93 Difference]: Finished difference Result 441 states and 623 transitions. [2024-10-13 06:39:21,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:39:21,658 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 159 [2024-10-13 06:39:21,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:39:21,660 INFO L225 Difference]: With dead ends: 441 [2024-10-13 06:39:21,660 INFO L226 Difference]: Without dead ends: 291 [2024-10-13 06:39:21,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:39:21,663 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 182 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:39:21,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 369 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:39:21,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-10-13 06:39:21,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 282. [2024-10-13 06:39:21,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 237 states have (on average 1.3206751054852321) internal successors, (313), 237 states have internal predecessors, (313), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 06:39:21,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 397 transitions. [2024-10-13 06:39:21,711 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 397 transitions. Word has length 159 [2024-10-13 06:39:21,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:39:21,712 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 397 transitions. [2024-10-13 06:39:21,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 06:39:21,712 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 397 transitions. [2024-10-13 06:39:21,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-13 06:39:21,713 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:39:21,713 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:21,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 06:39:21,714 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:39:21,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:39:21,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1683362386, now seen corresponding path program 1 times [2024-10-13 06:39:21,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:39:21,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803278381] [2024-10-13 06:39:21,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:39:21,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:39:21,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:24,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:39:24,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:24,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:39:24,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:24,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:39:24,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:24,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:39:24,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:24,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:39:24,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:24,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:39:24,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:24,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:39:24,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:24,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:39:24,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:24,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:39:24,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:24,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:39:24,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:24,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:39:24,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:24,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:39:24,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:24,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:39:24,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:24,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:39:24,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:24,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:39:24,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:24,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:39:24,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:24,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:39:24,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:24,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 06:39:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:24,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:39:24,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:24,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:39:24,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:24,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:39:24,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:24,700 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:39:24,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:39:24,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803278381] [2024-10-13 06:39:24,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803278381] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:39:24,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:39:24,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 06:39:24,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065213564] [2024-10-13 06:39:24,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:39:24,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 06:39:24,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:39:24,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 06:39:24,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:39:24,702 INFO L87 Difference]: Start difference. First operand 282 states and 397 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 06:39:25,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:39:25,550 INFO L93 Difference]: Finished difference Result 499 states and 698 transitions. [2024-10-13 06:39:25,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:39:25,552 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 160 [2024-10-13 06:39:25,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:39:25,555 INFO L225 Difference]: With dead ends: 499 [2024-10-13 06:39:25,555 INFO L226 Difference]: Without dead ends: 349 [2024-10-13 06:39:25,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-10-13 06:39:25,557 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 325 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 06:39:25,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 400 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 06:39:25,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-10-13 06:39:25,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 280. [2024-10-13 06:39:25,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 235 states have (on average 1.3191489361702127) internal successors, (310), 235 states have internal predecessors, (310), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 06:39:25,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 394 transitions. [2024-10-13 06:39:25,620 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 394 transitions. Word has length 160 [2024-10-13 06:39:25,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:39:25,621 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 394 transitions. [2024-10-13 06:39:25,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 06:39:25,621 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 394 transitions. [2024-10-13 06:39:25,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-13 06:39:25,622 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:39:25,622 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:25,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 06:39:25,622 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:39:25,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:39:25,623 INFO L85 PathProgramCache]: Analyzing trace with hash 206876626, now seen corresponding path program 1 times [2024-10-13 06:39:25,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:39:25,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958489154] [2024-10-13 06:39:25,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:39:25,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:39:25,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:26,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:39:26,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:26,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:39:26,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:27,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:39:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:27,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:39:27,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:27,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:39:27,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:27,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:39:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:27,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:39:27,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:27,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:39:27,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:27,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:39:27,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:27,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:39:27,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:27,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:39:27,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:27,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:39:27,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:27,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:39:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:27,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:39:27,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:27,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:39:27,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:27,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:39:27,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:27,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:39:27,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:27,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 06:39:27,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:27,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:39:27,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:27,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:39:27,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:27,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:39:27,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:27,183 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:39:27,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:39:27,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958489154] [2024-10-13 06:39:27,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958489154] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:39:27,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:39:27,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-13 06:39:27,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798349687] [2024-10-13 06:39:27,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:39:27,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 06:39:27,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:39:27,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 06:39:27,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-13 06:39:27,187 INFO L87 Difference]: Start difference. First operand 280 states and 394 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 06:39:27,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:39:27,892 INFO L93 Difference]: Finished difference Result 511 states and 715 transitions. [2024-10-13 06:39:27,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:39:27,893 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 160 [2024-10-13 06:39:27,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:39:27,895 INFO L225 Difference]: With dead ends: 511 [2024-10-13 06:39:27,895 INFO L226 Difference]: Without dead ends: 363 [2024-10-13 06:39:27,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2024-10-13 06:39:27,897 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 355 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 06:39:27,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 491 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 06:39:27,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-10-13 06:39:27,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 295. [2024-10-13 06:39:27,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 250 states have (on average 1.324) internal successors, (331), 250 states have internal predecessors, (331), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 06:39:27,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 415 transitions. [2024-10-13 06:39:27,942 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 415 transitions. Word has length 160 [2024-10-13 06:39:27,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:39:27,943 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 415 transitions. [2024-10-13 06:39:27,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 06:39:27,944 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 415 transitions. [2024-10-13 06:39:27,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-13 06:39:27,945 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:39:27,945 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:27,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 06:39:27,945 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:39:27,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:39:27,946 INFO L85 PathProgramCache]: Analyzing trace with hash -451806572, now seen corresponding path program 1 times [2024-10-13 06:39:27,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:39:27,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690088205] [2024-10-13 06:39:27,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:39:27,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:39:28,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:30,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:39:30,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:30,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:39:30,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:30,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:39:30,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:30,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:39:30,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:30,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:39:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:30,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:39:30,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:30,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:39:30,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:30,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:39:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:30,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:39:30,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:30,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:39:30,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:30,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:39:30,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:30,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:39:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:30,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:39:30,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:30,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:39:30,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:30,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:39:30,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:30,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:39:30,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:30,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:39:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:30,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 06:39:30,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:30,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:39:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:30,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:39:30,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:30,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:39:30,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:30,181 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:39:30,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:39:30,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690088205] [2024-10-13 06:39:30,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690088205] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:39:30,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:39:30,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 06:39:30,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735902651] [2024-10-13 06:39:30,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:39:30,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 06:39:30,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:39:30,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 06:39:30,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:39:30,184 INFO L87 Difference]: Start difference. First operand 295 states and 415 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 06:39:30,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:39:30,835 INFO L93 Difference]: Finished difference Result 569 states and 793 transitions. [2024-10-13 06:39:30,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:39:30,838 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 161 [2024-10-13 06:39:30,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:39:30,841 INFO L225 Difference]: With dead ends: 569 [2024-10-13 06:39:30,841 INFO L226 Difference]: Without dead ends: 406 [2024-10-13 06:39:30,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-10-13 06:39:30,845 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 456 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 06:39:30,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 370 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 06:39:30,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2024-10-13 06:39:30,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 295. [2024-10-13 06:39:30,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 250 states have (on average 1.324) internal successors, (331), 250 states have internal predecessors, (331), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 06:39:30,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 415 transitions. [2024-10-13 06:39:30,913 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 415 transitions. Word has length 161 [2024-10-13 06:39:30,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:39:30,916 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 415 transitions. [2024-10-13 06:39:30,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 06:39:30,916 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 415 transitions. [2024-10-13 06:39:30,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-13 06:39:30,917 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:39:30,917 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:30,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 06:39:30,918 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:39:30,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:39:30,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1038612586, now seen corresponding path program 1 times [2024-10-13 06:39:30,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:39:30,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884727041] [2024-10-13 06:39:30,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:39:30,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:39:31,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:33,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:39:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:33,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:39:33,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:33,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:39:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:33,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:39:33,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:33,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:39:33,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:33,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:39:33,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:33,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:39:33,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:33,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:39:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:33,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:39:33,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:33,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:39:33,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:33,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:39:33,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:33,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:39:33,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:33,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:39:33,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:33,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:39:33,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:33,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:39:33,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:33,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:39:33,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:33,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:39:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:33,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 06:39:33,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:33,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:39:33,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:33,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:39:33,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:33,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:39:33,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:33,267 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:39:33,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:39:33,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884727041] [2024-10-13 06:39:33,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884727041] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:39:33,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:39:33,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-13 06:39:33,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205277772] [2024-10-13 06:39:33,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:39:33,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 06:39:33,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:39:33,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 06:39:33,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-13 06:39:33,271 INFO L87 Difference]: Start difference. First operand 295 states and 415 transitions. Second operand has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 12 states have internal predecessors, (59), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2024-10-13 06:39:34,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:39:34,202 INFO L93 Difference]: Finished difference Result 716 states and 1000 transitions. [2024-10-13 06:39:34,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 06:39:34,203 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 12 states have internal predecessors, (59), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) Word has length 161 [2024-10-13 06:39:34,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:39:34,206 INFO L225 Difference]: With dead ends: 716 [2024-10-13 06:39:34,206 INFO L226 Difference]: Without dead ends: 422 [2024-10-13 06:39:34,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2024-10-13 06:39:34,208 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 380 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 06:39:34,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 647 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 06:39:34,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2024-10-13 06:39:34,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 345. [2024-10-13 06:39:34,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 300 states have (on average 1.33) internal successors, (399), 300 states have internal predecessors, (399), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 06:39:34,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 483 transitions. [2024-10-13 06:39:34,267 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 483 transitions. Word has length 161 [2024-10-13 06:39:34,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:39:34,268 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 483 transitions. [2024-10-13 06:39:34,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 12 states have internal predecessors, (59), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2024-10-13 06:39:34,268 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 483 transitions. [2024-10-13 06:39:34,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-13 06:39:34,269 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:39:34,270 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:34,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 06:39:34,270 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:39:34,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:39:34,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1928292332, now seen corresponding path program 1 times [2024-10-13 06:39:34,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:39:34,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268739239] [2024-10-13 06:39:34,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:39:34,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:39:34,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:37,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:39:37,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:37,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:39:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:37,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:39:37,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:37,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:39:37,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:37,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:39:37,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:37,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:39:37,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:37,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:39:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:37,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:39:37,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:37,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:39:37,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:37,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:39:37,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:37,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:39:37,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:37,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:39:37,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:37,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:39:37,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:37,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:39:37,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:37,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:39:37,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:37,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:39:37,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:37,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:39:37,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:37,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 06:39:37,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:37,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:39:37,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:37,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:39:37,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:37,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 06:39:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:39:37,993 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 06:39:37,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:39:37,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268739239] [2024-10-13 06:39:37,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268739239] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:39:37,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:39:37,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-13 06:39:37,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340088068] [2024-10-13 06:39:37,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:39:37,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 06:39:37,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:39:37,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 06:39:37,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-13 06:39:37,996 INFO L87 Difference]: Start difference. First operand 345 states and 483 transitions. Second operand has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 06:39:38,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:39:38,925 INFO L93 Difference]: Finished difference Result 604 states and 841 transitions. [2024-10-13 06:39:38,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:39:38,926 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 161 [2024-10-13 06:39:38,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:39:38,928 INFO L225 Difference]: With dead ends: 604 [2024-10-13 06:39:38,928 INFO L226 Difference]: Without dead ends: 416 [2024-10-13 06:39:38,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2024-10-13 06:39:38,929 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 293 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 06:39:38,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 514 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 06:39:38,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-10-13 06:39:38,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 339. [2024-10-13 06:39:38,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 294 states have (on average 1.3265306122448979) internal successors, (390), 294 states have internal predecessors, (390), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-13 06:39:38,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 474 transitions. [2024-10-13 06:39:38,971 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 474 transitions. Word has length 161 [2024-10-13 06:39:38,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:39:38,971 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 474 transitions. [2024-10-13 06:39:38,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 06:39:38,972 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 474 transitions. [2024-10-13 06:39:38,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-13 06:39:38,973 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:39:38,973 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:38,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 06:39:38,974 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:39:38,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:39:38,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1172626092, now seen corresponding path program 1 times [2024-10-13 06:39:38,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:39:38,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779826288] [2024-10-13 06:39:38,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:39:38,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:39:39,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat