./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-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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-63.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 d64de34e5de9d482cf02ff075dad73aa3037f7014946daf08dc02de47434f33e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 12:01:10,824 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 12:01:10,902 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 12:01:10,906 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 12:01:10,906 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 12:01:10,926 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 12:01:10,927 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 12:01:10,927 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 12:01:10,928 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 12:01:10,928 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 12:01:10,928 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 12:01:10,929 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 12:01:10,929 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 12:01:10,929 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 12:01:10,930 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 12:01:10,931 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 12:01:10,931 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 12:01:10,931 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 12:01:10,932 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 12:01:10,932 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 12:01:10,932 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 12:01:10,933 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 12:01:10,934 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 12:01:10,934 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 12:01:10,934 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 12:01:10,935 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 12:01:10,935 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 12:01:10,935 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 12:01:10,936 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 12:01:10,936 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 12:01:10,936 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 12:01:10,937 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 12:01:10,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:01:10,938 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 12:01:10,938 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 12:01:10,938 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 12:01:10,939 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 12:01:10,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 12:01:10,939 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 12:01:10,940 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 12:01:10,940 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 12:01:10,940 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 12:01:10,941 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 -> d64de34e5de9d482cf02ff075dad73aa3037f7014946daf08dc02de47434f33e [2024-10-24 12:01:11,203 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 12:01:11,232 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 12:01:11,236 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 12:01:11,238 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 12:01:11,239 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 12:01:11,241 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-63.i [2024-10-24 12:01:12,735 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 12:01:12,986 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 12:01:12,987 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-63.i [2024-10-24 12:01:13,001 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9e334279/0b00bf10d5f042dd95b8a4b59a67974e/FLAG188850a35 [2024-10-24 12:01:13,317 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9e334279/0b00bf10d5f042dd95b8a4b59a67974e [2024-10-24 12:01:13,320 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 12:01:13,321 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 12:01:13,324 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 12:01:13,324 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 12:01:13,328 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 12:01:13,329 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:01:13" (1/1) ... [2024-10-24 12:01:13,330 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2960f6af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:01:13, skipping insertion in model container [2024-10-24 12:01:13,330 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:01:13" (1/1) ... [2024-10-24 12:01:13,363 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 12:01:13,544 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-63.i[917,930] [2024-10-24 12:01:13,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:01:13,631 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 12:01:13,641 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-63.i[917,930] [2024-10-24 12:01:13,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:01:13,733 INFO L204 MainTranslator]: Completed translation [2024-10-24 12:01:13,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:01:13 WrapperNode [2024-10-24 12:01:13,733 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 12:01:13,734 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 12:01:13,734 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 12:01:13,735 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 12:01:13,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:01:13" (1/1) ... [2024-10-24 12:01:13,763 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:01:13" (1/1) ... [2024-10-24 12:01:13,799 INFO L138 Inliner]: procedures = 29, calls = 204, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 677 [2024-10-24 12:01:13,800 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 12:01:13,800 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 12:01:13,801 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 12:01:13,801 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 12:01:13,817 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:01:13" (1/1) ... [2024-10-24 12:01:13,817 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:01:13" (1/1) ... [2024-10-24 12:01:13,823 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:01:13" (1/1) ... [2024-10-24 12:01:13,856 INFO L175 MemorySlicer]: Split 174 memory accesses to 2 slices as follows [2, 172]. 99 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [2, 18]. The 19 writes are split as follows [0, 19]. [2024-10-24 12:01:13,856 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:01:13" (1/1) ... [2024-10-24 12:01:13,856 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:01:13" (1/1) ... [2024-10-24 12:01:13,873 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:01:13" (1/1) ... [2024-10-24 12:01:13,878 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:01:13" (1/1) ... [2024-10-24 12:01:13,882 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:01:13" (1/1) ... [2024-10-24 12:01:13,885 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:01:13" (1/1) ... [2024-10-24 12:01:13,891 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 12:01:13,892 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 12:01:13,892 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 12:01:13,892 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 12:01:13,893 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:01:13" (1/1) ... [2024-10-24 12:01:13,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:01:13,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:01:13,936 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-24 12:01:13,939 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-24 12:01:13,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 12:01:13,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 12:01:13,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 12:01:13,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 12:01:13,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 12:01:13,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 12:01:13,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 12:01:13,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 12:01:13,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 12:01:13,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 12:01:13,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 12:01:13,986 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 12:01:13,986 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 12:01:13,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 12:01:13,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 12:01:13,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 12:01:13,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 12:01:14,194 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 12:01:14,198 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 12:01:14,848 INFO L? ?]: Removed 201 outVars from TransFormulas that were not future-live. [2024-10-24 12:01:14,849 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 12:01:14,904 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 12:01:14,905 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 12:01:14,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:01:14 BoogieIcfgContainer [2024-10-24 12:01:14,906 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 12:01:14,909 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 12:01:14,909 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 12:01:14,915 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 12:01:14,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:01:13" (1/3) ... [2024-10-24 12:01:14,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df818d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:01:14, skipping insertion in model container [2024-10-24 12:01:14,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:01:13" (2/3) ... [2024-10-24 12:01:14,919 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df818d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:01:14, skipping insertion in model container [2024-10-24 12:01:14,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:01:14" (3/3) ... [2024-10-24 12:01:14,921 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-63.i [2024-10-24 12:01:14,940 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 12:01:14,940 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 12:01:15,017 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 12:01:15,027 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;@26eeffb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 12:01:15,031 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 12:01:15,037 INFO L276 IsEmpty]: Start isEmpty. Operand has 132 states, 111 states have (on average 1.4594594594594594) internal successors, (162), 112 states have internal predecessors, (162), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 12:01:15,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-24 12:01:15,054 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:01:15,055 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 12:01:15,055 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:01:15,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:01:15,061 INFO L85 PathProgramCache]: Analyzing trace with hash -251190212, now seen corresponding path program 1 times [2024-10-24 12:01:15,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:01:15,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530761613] [2024-10-24 12:01:15,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:01:15,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:01:15,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:15,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 12:01:15,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:15,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:01:15,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:15,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 12:01:15,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:15,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 12:01:15,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:15,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 12:01:15,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:15,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:01:15,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:15,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:01:15,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:15,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:01:15,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:15,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:01:15,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:15,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:01:15,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:15,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:01:15,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:15,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:01:15,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:15,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:01:15,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:15,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 12:01:15,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:15,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 12:01:15,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:15,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 12:01:15,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:15,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 12:01:15,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:15,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 12:01:15,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:15,648 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 12:01:15,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:01:15,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530761613] [2024-10-24 12:01:15,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530761613] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:01:15,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:01:15,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 12:01:15,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036596641] [2024-10-24 12:01:15,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:01:15,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 12:01:15,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:01:15,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 12:01:15,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 12:01:15,697 INFO L87 Difference]: Start difference. First operand has 132 states, 111 states have (on average 1.4594594594594594) internal successors, (162), 112 states have internal predecessors, (162), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-24 12:01:15,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:01:15,773 INFO L93 Difference]: Finished difference Result 261 states and 412 transitions. [2024-10-24 12:01:15,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 12:01:15,777 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 151 [2024-10-24 12:01:15,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:01:15,789 INFO L225 Difference]: With dead ends: 261 [2024-10-24 12:01:15,789 INFO L226 Difference]: Without dead ends: 130 [2024-10-24 12:01:15,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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-24 12:01:15,800 INFO L432 NwaCegarLoop]: 189 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, 189 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-24 12:01:15,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 189 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 12:01:15,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-24 12:01:15,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-10-24 12:01:15,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 110 states have (on average 1.4272727272727272) internal successors, (157), 110 states have internal predecessors, (157), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 12:01:15,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 193 transitions. [2024-10-24 12:01:15,859 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 193 transitions. Word has length 151 [2024-10-24 12:01:15,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:01:15,860 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 193 transitions. [2024-10-24 12:01:15,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-24 12:01:15,860 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 193 transitions. [2024-10-24 12:01:15,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-24 12:01:15,864 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:01:15,865 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 12:01:15,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 12:01:15,865 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:01:15,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:01:15,866 INFO L85 PathProgramCache]: Analyzing trace with hash -380351792, now seen corresponding path program 1 times [2024-10-24 12:01:15,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:01:15,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605122213] [2024-10-24 12:01:15,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:01:15,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:01:16,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:16,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 12:01:16,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:16,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:01:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:16,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 12:01:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:16,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 12:01:16,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:16,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 12:01:16,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:16,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:01:16,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:16,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:01:16,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:16,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:01:16,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:16,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:01:16,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:16,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:01:16,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:16,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:01:16,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:16,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:01:16,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:16,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:01:16,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:16,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 12:01:16,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:16,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 12:01:16,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:16,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 12:01:16,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:16,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 12:01:16,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:16,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 12:01:16,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:16,607 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 12:01:16,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:01:16,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605122213] [2024-10-24 12:01:16,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605122213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:01:16,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:01:16,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 12:01:16,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817339422] [2024-10-24 12:01:16,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:01:16,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:01:16,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:01:16,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:01:16,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:01:16,615 INFO L87 Difference]: Start difference. First operand 130 states and 193 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 12:01:16,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:01:16,687 INFO L93 Difference]: Finished difference Result 261 states and 388 transitions. [2024-10-24 12:01:16,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 12:01:16,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 151 [2024-10-24 12:01:16,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:01:16,690 INFO L225 Difference]: With dead ends: 261 [2024-10-24 12:01:16,690 INFO L226 Difference]: Without dead ends: 132 [2024-10-24 12:01:16,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 39 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-24 12:01:16,693 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 0 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 12:01:16,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 554 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 12:01:16,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-24 12:01:16,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-10-24 12:01:16,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 112 states have (on average 1.4196428571428572) internal successors, (159), 112 states have internal predecessors, (159), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 12:01:16,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 195 transitions. [2024-10-24 12:01:16,713 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 195 transitions. Word has length 151 [2024-10-24 12:01:16,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:01:16,715 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 195 transitions. [2024-10-24 12:01:16,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 12:01:16,716 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 195 transitions. [2024-10-24 12:01:16,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-24 12:01:16,718 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:01:16,718 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 12:01:16,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 12:01:16,719 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:01:16,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:01:16,720 INFO L85 PathProgramCache]: Analyzing trace with hash -120686475, now seen corresponding path program 1 times [2024-10-24 12:01:16,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:01:16,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571830316] [2024-10-24 12:01:16,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:01:16,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:01:16,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:16,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 12:01:16,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:16,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:01:16,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:16,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 12:01:16,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:16,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 12:01:16,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:16,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 12:01:16,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:16,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:01:16,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:16,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:01:16,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:16,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:01:17,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:17,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:01:17,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:17,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:01:17,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:17,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:01:17,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:17,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:01:17,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:17,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:01:17,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:17,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 12:01:17,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:17,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 12:01:17,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:17,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 12:01:17,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:17,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 12:01:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:17,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 12:01:17,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:17,054 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 12:01:17,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:01:17,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571830316] [2024-10-24 12:01:17,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571830316] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:01:17,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:01:17,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 12:01:17,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858200976] [2024-10-24 12:01:17,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:01:17,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:01:17,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:01:17,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:01:17,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:01:17,061 INFO L87 Difference]: Start difference. First operand 132 states and 195 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 12:01:17,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:01:17,129 INFO L93 Difference]: Finished difference Result 266 states and 393 transitions. [2024-10-24 12:01:17,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 12:01:17,130 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 153 [2024-10-24 12:01:17,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:01:17,132 INFO L225 Difference]: With dead ends: 266 [2024-10-24 12:01:17,132 INFO L226 Difference]: Without dead ends: 135 [2024-10-24 12:01:17,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 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-24 12:01:17,134 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 1 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 12:01:17,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 551 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 12:01:17,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-24 12:01:17,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2024-10-24 12:01:17,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 114 states have (on average 1.412280701754386) internal successors, (161), 114 states have internal predecessors, (161), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 12:01:17,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 197 transitions. [2024-10-24 12:01:17,146 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 197 transitions. Word has length 153 [2024-10-24 12:01:17,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:01:17,147 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 197 transitions. [2024-10-24 12:01:17,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 12:01:17,148 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 197 transitions. [2024-10-24 12:01:17,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-24 12:01:17,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:01:17,150 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 12:01:17,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 12:01:17,151 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:01:17,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:01:17,151 INFO L85 PathProgramCache]: Analyzing trace with hash 137478963, now seen corresponding path program 1 times [2024-10-24 12:01:17,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:01:17,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368287470] [2024-10-24 12:01:17,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:01:17,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:01:17,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:17,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 12:01:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:17,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:01:17,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:17,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 12:01:17,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:17,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 12:01:17,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:17,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 12:01:17,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:17,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:01:17,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:17,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:01:17,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:17,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:01:17,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:17,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:01:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:17,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:01:17,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:17,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:01:17,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:17,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:01:17,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:17,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:01:17,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:17,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 12:01:17,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:17,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 12:01:17,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:17,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 12:01:17,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:17,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 12:01:17,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:17,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 12:01:17,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:17,452 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 12:01:17,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:01:17,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368287470] [2024-10-24 12:01:17,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368287470] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:01:17,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:01:17,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 12:01:17,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787721955] [2024-10-24 12:01:17,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:01:17,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:01:17,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:01:17,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:01:17,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:01:17,457 INFO L87 Difference]: Start difference. First operand 134 states and 197 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 12:01:17,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:01:17,508 INFO L93 Difference]: Finished difference Result 270 states and 397 transitions. [2024-10-24 12:01:17,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 12:01:17,510 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 153 [2024-10-24 12:01:17,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:01:17,513 INFO L225 Difference]: With dead ends: 270 [2024-10-24 12:01:17,515 INFO L226 Difference]: Without dead ends: 137 [2024-10-24 12:01:17,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 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-24 12:01:17,520 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 1 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 12:01:17,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 551 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 12:01:17,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-24 12:01:17,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2024-10-24 12:01:17,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 116 states have (on average 1.4051724137931034) internal successors, (163), 116 states have internal predecessors, (163), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 12:01:17,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 199 transitions. [2024-10-24 12:01:17,536 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 199 transitions. Word has length 153 [2024-10-24 12:01:17,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:01:17,538 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 199 transitions. [2024-10-24 12:01:17,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 12:01:17,539 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 199 transitions. [2024-10-24 12:01:17,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-24 12:01:17,542 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:01:17,543 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 12:01:17,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 12:01:17,543 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:01:17,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:01:17,544 INFO L85 PathProgramCache]: Analyzing trace with hash -671867663, now seen corresponding path program 1 times [2024-10-24 12:01:17,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:01:17,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174683447] [2024-10-24 12:01:17,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:01:17,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:01:17,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:17,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 12:01:17,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:17,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:01:17,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:17,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 12:01:17,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:17,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 12:01:17,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:17,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 12:01:17,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:17,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:01:17,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:17,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:01:17,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:17,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:01:17,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:17,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:01:17,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:17,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:01:17,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:17,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:01:17,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:17,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:01:17,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:17,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:01:17,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:17,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 12:01:17,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:17,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 12:01:17,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:17,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 12:01:17,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:17,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 12:01:17,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:17,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 12:01:17,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:17,788 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 12:01:17,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:01:17,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174683447] [2024-10-24 12:01:17,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174683447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:01:17,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:01:17,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 12:01:17,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622754436] [2024-10-24 12:01:17,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:01:17,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:01:17,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:01:17,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:01:17,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:01:17,795 INFO L87 Difference]: Start difference. First operand 136 states and 199 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 12:01:17,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:01:17,841 INFO L93 Difference]: Finished difference Result 274 states and 401 transitions. [2024-10-24 12:01:17,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 12:01:17,842 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 153 [2024-10-24 12:01:17,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:01:17,843 INFO L225 Difference]: With dead ends: 274 [2024-10-24 12:01:17,845 INFO L226 Difference]: Without dead ends: 139 [2024-10-24 12:01:17,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 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-24 12:01:17,847 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 1 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 12:01:17,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 552 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 12:01:17,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-10-24 12:01:17,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2024-10-24 12:01:17,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 118 states have (on average 1.3983050847457628) internal successors, (165), 118 states have internal predecessors, (165), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 12:01:17,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 201 transitions. [2024-10-24 12:01:17,868 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 201 transitions. Word has length 153 [2024-10-24 12:01:17,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:01:17,869 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 201 transitions. [2024-10-24 12:01:17,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 12:01:17,869 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 201 transitions. [2024-10-24 12:01:17,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-24 12:01:17,873 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:01:17,873 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 12:01:17,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 12:01:17,873 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:01:17,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:01:17,874 INFO L85 PathProgramCache]: Analyzing trace with hash -614609361, now seen corresponding path program 1 times [2024-10-24 12:01:17,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:01:17,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736540261] [2024-10-24 12:01:17,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:01:17,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:01:17,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:18,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 12:01:18,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:18,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:01:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:18,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 12:01:18,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:18,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 12:01:18,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:18,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 12:01:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:18,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:01:18,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:18,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:01:18,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:18,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:01:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:18,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:01:18,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:18,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:01:18,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:18,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:01:18,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:18,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:01:18,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:18,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:01:18,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:18,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 12:01:18,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:18,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 12:01:18,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:18,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 12:01:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:18,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 12:01:18,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:18,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 12:01:18,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:18,107 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 12:01:18,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:01:18,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736540261] [2024-10-24 12:01:18,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736540261] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:01:18,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:01:18,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 12:01:18,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156828912] [2024-10-24 12:01:18,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:01:18,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:01:18,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:01:18,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:01:18,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:01:18,109 INFO L87 Difference]: Start difference. First operand 138 states and 201 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 12:01:18,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:01:18,149 INFO L93 Difference]: Finished difference Result 278 states and 405 transitions. [2024-10-24 12:01:18,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 12:01:18,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 153 [2024-10-24 12:01:18,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:01:18,152 INFO L225 Difference]: With dead ends: 278 [2024-10-24 12:01:18,152 INFO L226 Difference]: Without dead ends: 141 [2024-10-24 12:01:18,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 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-24 12:01:18,155 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 1 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 12:01:18,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 555 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 12:01:18,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-10-24 12:01:18,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2024-10-24 12:01:18,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 120 states have (on average 1.3916666666666666) internal successors, (167), 120 states have internal predecessors, (167), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 12:01:18,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 203 transitions. [2024-10-24 12:01:18,166 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 203 transitions. Word has length 153 [2024-10-24 12:01:18,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:01:18,166 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 203 transitions. [2024-10-24 12:01:18,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 12:01:18,167 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 203 transitions. [2024-10-24 12:01:18,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-24 12:01:18,168 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:01:18,169 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 12:01:18,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 12:01:18,169 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:01:18,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:01:18,170 INFO L85 PathProgramCache]: Analyzing trace with hash -614549779, now seen corresponding path program 1 times [2024-10-24 12:01:18,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:01:18,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576437980] [2024-10-24 12:01:18,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:01:18,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:01:18,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:21,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 12:01:21,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:21,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:01:21,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:21,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 12:01:21,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:21,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 12:01:21,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:21,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 12:01:21,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:21,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:01:21,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:21,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:01:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:21,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:01:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:22,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:01:22,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:22,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:01:22,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:22,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:01:22,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:22,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:01:22,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:22,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:01:22,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:22,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 12:01:22,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:22,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 12:01:22,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:22,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 12:01:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:22,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 12:01:22,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:22,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 12:01:22,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:22,174 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-10-24 12:01:22,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:01:22,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576437980] [2024-10-24 12:01:22,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576437980] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:01:22,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23074511] [2024-10-24 12:01:22,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:01:22,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:01:22,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:01:22,178 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 12:01:22,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 12:01:22,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:22,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-10-24 12:01:22,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:01:24,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 12:01:24,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-24 12:01:25,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-24 12:01:26,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-24 12:01:26,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-24 12:01:27,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-24 12:01:27,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-24 12:01:28,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-24 12:01:29,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2024-10-24 12:01:29,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2024-10-24 12:01:29,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2024-10-24 12:01:29,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2024-10-24 12:01:29,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2024-10-24 12:01:29,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2024-10-24 12:01:29,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2024-10-24 12:01:29,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2024-10-24 12:01:29,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2024-10-24 12:01:29,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2024-10-24 12:01:29,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2024-10-24 12:01:29,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2024-10-24 12:01:29,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2024-10-24 12:01:29,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2024-10-24 12:01:29,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2024-10-24 12:01:29,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2024-10-24 12:01:29,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2024-10-24 12:01:29,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2024-10-24 12:01:29,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2024-10-24 12:01:29,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2024-10-24 12:01:29,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2024-10-24 12:01:29,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2024-10-24 12:01:29,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2024-10-24 12:01:29,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2024-10-24 12:01:29,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2024-10-24 12:01:29,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2024-10-24 12:01:29,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2024-10-24 12:01:29,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2024-10-24 12:01:29,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2024-10-24 12:01:29,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2024-10-24 12:01:29,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2024-10-24 12:01:29,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2024-10-24 12:01:29,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49 [2024-10-24 12:01:29,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2024-10-24 12:01:29,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2024-10-24 12:01:29,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2024-10-24 12:01:29,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2024-10-24 12:01:29,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2024-10-24 12:01:29,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2024-10-24 12:01:29,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2024-10-24 12:01:29,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 60 [2024-10-24 12:01:29,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 20 [2024-10-24 12:01:29,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49 [2024-10-24 12:01:29,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2024-10-24 12:01:29,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49 [2024-10-24 12:01:29,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2024-10-24 12:01:29,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2024-10-24 12:01:29,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:29,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2024-10-24 12:01:30,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:30,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:30,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:30,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:30,197 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-24 12:01:30,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2024-10-24 12:01:30,435 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 199 proven. 161 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-10-24 12:01:30,435 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 12:01:30,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23074511] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:01:30,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 12:01:30,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 21 [2024-10-24 12:01:30,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594957278] [2024-10-24 12:01:30,676 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 12:01:30,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-24 12:01:30,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:01:30,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-24 12:01:30,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2024-10-24 12:01:30,681 INFO L87 Difference]: Start difference. First operand 140 states and 203 transitions. Second operand has 21 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 21 states have internal predecessors, (128), 9 states have call successors, (36), 4 states have call predecessors, (36), 6 states have return successors, (36), 7 states have call predecessors, (36), 9 states have call successors, (36) [2024-10-24 12:01:34,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:01:34,322 INFO L93 Difference]: Finished difference Result 513 states and 727 transitions. [2024-10-24 12:01:34,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-24 12:01:34,322 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 21 states have internal predecessors, (128), 9 states have call successors, (36), 4 states have call predecessors, (36), 6 states have return successors, (36), 7 states have call predecessors, (36), 9 states have call successors, (36) Word has length 153 [2024-10-24 12:01:34,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:01:34,325 INFO L225 Difference]: With dead ends: 513 [2024-10-24 12:01:34,325 INFO L226 Difference]: Without dead ends: 374 [2024-10-24 12:01:34,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 220 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=462, Invalid=1700, Unknown=0, NotChecked=0, Total=2162 [2024-10-24 12:01:34,327 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 1591 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 1620 mSolverCounterSat, 190 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1594 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 1812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 1620 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-24 12:01:34,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1594 Valid, 945 Invalid, 1812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 1620 Invalid, 2 Unknown, 0 Unchecked, 2.2s Time] [2024-10-24 12:01:34,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-10-24 12:01:34,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 244. [2024-10-24 12:01:34,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 216 states have (on average 1.3935185185185186) internal successors, (301), 217 states have internal predecessors, (301), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 12:01:34,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 347 transitions. [2024-10-24 12:01:34,364 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 347 transitions. Word has length 153 [2024-10-24 12:01:34,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:01:34,364 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 347 transitions. [2024-10-24 12:01:34,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 21 states have internal predecessors, (128), 9 states have call successors, (36), 4 states have call predecessors, (36), 6 states have return successors, (36), 7 states have call predecessors, (36), 9 states have call successors, (36) [2024-10-24 12:01:34,365 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 347 transitions. [2024-10-24 12:01:34,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-24 12:01:34,368 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:01:34,368 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 12:01:34,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 12:01:34,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:01:34,572 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:01:34,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:01:34,572 INFO L85 PathProgramCache]: Analyzing trace with hash 2092069615, now seen corresponding path program 1 times [2024-10-24 12:01:34,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:01:34,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701591558] [2024-10-24 12:01:34,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:01:34,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:01:34,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:37,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 12:01:37,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:37,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:01:37,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:37,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 12:01:37,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:37,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 12:01:37,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:37,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 12:01:37,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:37,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:01:37,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:37,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:01:37,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:37,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:01:37,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:37,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:01:37,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:37,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:01:37,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:37,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:01:37,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:37,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:01:37,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:37,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:01:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:37,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 12:01:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:37,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 12:01:37,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:37,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 12:01:37,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:37,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 12:01:37,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:37,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 12:01:37,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:37,422 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 12:01:37,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:01:37,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701591558] [2024-10-24 12:01:37,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701591558] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:01:37,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:01:37,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 12:01:37,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553684317] [2024-10-24 12:01:37,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:01:37,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 12:01:37,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:01:37,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 12:01:37,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-10-24 12:01:37,425 INFO L87 Difference]: Start difference. First operand 244 states and 347 transitions. Second operand has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-24 12:01:38,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:01:38,174 INFO L93 Difference]: Finished difference Result 632 states and 898 transitions. [2024-10-24 12:01:38,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 12:01:38,175 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 153 [2024-10-24 12:01:38,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:01:38,179 INFO L225 Difference]: With dead ends: 632 [2024-10-24 12:01:38,179 INFO L226 Difference]: Without dead ends: 389 [2024-10-24 12:01:38,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2024-10-24 12:01:38,180 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 379 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 12:01:38,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 850 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 12:01:38,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-10-24 12:01:38,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 379. [2024-10-24 12:01:38,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 330 states have (on average 1.3848484848484848) internal successors, (457), 331 states have internal predecessors, (457), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-24 12:01:38,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 539 transitions. [2024-10-24 12:01:38,219 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 539 transitions. Word has length 153 [2024-10-24 12:01:38,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:01:38,220 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 539 transitions. [2024-10-24 12:01:38,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-24 12:01:38,220 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 539 transitions. [2024-10-24 12:01:38,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-24 12:01:38,222 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:01:38,222 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 12:01:38,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 12:01:38,223 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:01:38,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:01:38,223 INFO L85 PathProgramCache]: Analyzing trace with hash -280328362, now seen corresponding path program 1 times [2024-10-24 12:01:38,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:01:38,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757837388] [2024-10-24 12:01:38,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:01:38,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:01:38,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:40,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 12:01:40,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:40,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:01:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:40,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 12:01:40,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:40,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 12:01:40,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:40,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 12:01:40,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:40,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:01:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:40,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:01:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:40,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:01:40,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:40,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:01:40,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:40,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:01:40,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:40,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:01:40,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:40,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:01:40,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:40,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:01:40,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:40,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 12:01:40,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:41,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 12:01:41,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:41,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 12:01:41,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:41,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 12:01:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:41,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 12:01:41,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:41,053 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 12:01:41,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:01:41,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757837388] [2024-10-24 12:01:41,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757837388] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:01:41,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:01:41,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 12:01:41,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202065019] [2024-10-24 12:01:41,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:01:41,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 12:01:41,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:01:41,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 12:01:41,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-24 12:01:41,057 INFO L87 Difference]: Start difference. First operand 379 states and 539 transitions. Second operand has 11 states, 10 states have (on average 6.8) internal successors, (68), 11 states have internal predecessors, (68), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-10-24 12:01:41,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:01:41,809 INFO L93 Difference]: Finished difference Result 768 states and 1091 transitions. [2024-10-24 12:01:41,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 12:01:41,810 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.8) internal successors, (68), 11 states have internal predecessors, (68), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 155 [2024-10-24 12:01:41,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:01:41,813 INFO L225 Difference]: With dead ends: 768 [2024-10-24 12:01:41,813 INFO L226 Difference]: Without dead ends: 390 [2024-10-24 12:01:41,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-10-24 12:01:41,815 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 637 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 12:01:41,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 441 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 12:01:41,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-10-24 12:01:41,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 383. [2024-10-24 12:01:41,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 334 states have (on average 1.3802395209580838) internal successors, (461), 335 states have internal predecessors, (461), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-24 12:01:41,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 543 transitions. [2024-10-24 12:01:41,868 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 543 transitions. Word has length 155 [2024-10-24 12:01:41,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:01:41,868 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 543 transitions. [2024-10-24 12:01:41,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.8) internal successors, (68), 11 states have internal predecessors, (68), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-10-24 12:01:41,868 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 543 transitions. [2024-10-24 12:01:41,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-24 12:01:41,870 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:01:41,870 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 12:01:41,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 12:01:41,870 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:01:41,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:01:41,871 INFO L85 PathProgramCache]: Analyzing trace with hash -22162924, now seen corresponding path program 1 times [2024-10-24 12:01:41,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:01:41,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611158519] [2024-10-24 12:01:41,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:01:41,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:01:41,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:42,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 12:01:42,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:42,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:01:42,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:42,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 12:01:42,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:42,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 12:01:42,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:42,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 12:01:42,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:42,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:01:42,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:42,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:01:42,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:42,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:01:42,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:42,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:01:42,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:42,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:01:42,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:42,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:01:42,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:42,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:01:42,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:42,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:01:42,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:42,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 12:01:42,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:42,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 12:01:42,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:42,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 12:01:42,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:42,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 12:01:42,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:42,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 12:01:42,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:42,404 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 12:01:42,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:01:42,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611158519] [2024-10-24 12:01:42,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611158519] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:01:42,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:01:42,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 12:01:42,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366663709] [2024-10-24 12:01:42,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:01:42,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 12:01:42,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:01:42,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 12:01:42,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 12:01:42,409 INFO L87 Difference]: Start difference. First operand 383 states and 543 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-24 12:01:42,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:01:42,885 INFO L93 Difference]: Finished difference Result 932 states and 1314 transitions. [2024-10-24 12:01:42,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 12:01:42,886 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 155 [2024-10-24 12:01:42,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:01:42,889 INFO L225 Difference]: With dead ends: 932 [2024-10-24 12:01:42,890 INFO L226 Difference]: Without dead ends: 550 [2024-10-24 12:01:42,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-10-24 12:01:42,891 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 268 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 12:01:42,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 548 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 12:01:42,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2024-10-24 12:01:42,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 429. [2024-10-24 12:01:42,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 380 states have (on average 1.3736842105263158) internal successors, (522), 381 states have internal predecessors, (522), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-24 12:01:42,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 604 transitions. [2024-10-24 12:01:42,949 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 604 transitions. Word has length 155 [2024-10-24 12:01:42,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:01:42,951 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 604 transitions. [2024-10-24 12:01:42,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-24 12:01:42,951 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 604 transitions. [2024-10-24 12:01:42,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-24 12:01:42,953 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:01:42,953 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 12:01:42,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 12:01:42,953 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:01:42,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:01:42,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1167779288, now seen corresponding path program 1 times [2024-10-24 12:01:42,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:01:42,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693292899] [2024-10-24 12:01:42,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:01:42,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:01:43,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:44,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 12:01:44,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:44,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:01:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:44,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 12:01:44,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:44,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 12:01:44,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:44,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 12:01:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:44,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:01:44,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:44,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:01:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:44,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:01:44,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:44,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:01:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:44,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:01:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:44,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:01:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:44,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:01:44,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:44,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:01:44,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:44,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 12:01:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:44,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 12:01:44,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:44,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 12:01:44,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:44,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 12:01:44,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:44,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 12:01:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:44,409 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 12:01:44,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:01:44,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693292899] [2024-10-24 12:01:44,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693292899] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:01:44,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:01:44,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 12:01:44,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865315586] [2024-10-24 12:01:44,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:01:44,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 12:01:44,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:01:44,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 12:01:44,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-24 12:01:44,412 INFO L87 Difference]: Start difference. First operand 429 states and 604 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 12:01:45,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:01:45,537 INFO L93 Difference]: Finished difference Result 812 states and 1142 transitions. [2024-10-24 12:01:45,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 12:01:45,538 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 155 [2024-10-24 12:01:45,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:01:45,541 INFO L225 Difference]: With dead ends: 812 [2024-10-24 12:01:45,541 INFO L226 Difference]: Without dead ends: 535 [2024-10-24 12:01:45,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2024-10-24 12:01:45,542 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 521 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 1110 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 1146 SdHoareTripleChecker+Invalid, 1117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 12:01:45,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 1146 Invalid, 1117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1110 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 12:01:45,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-10-24 12:01:45,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 458. [2024-10-24 12:01:45,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 409 states have (on average 1.3838630806845966) internal successors, (566), 410 states have internal predecessors, (566), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-24 12:01:45,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 648 transitions. [2024-10-24 12:01:45,605 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 648 transitions. Word has length 155 [2024-10-24 12:01:45,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:01:45,605 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 648 transitions. [2024-10-24 12:01:45,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 12:01:45,606 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 648 transitions. [2024-10-24 12:01:45,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-24 12:01:45,608 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:01:45,609 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 12:01:45,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 12:01:45,609 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:01:45,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:01:45,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1538840106, now seen corresponding path program 1 times [2024-10-24 12:01:45,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:01:45,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885080549] [2024-10-24 12:01:45,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:01:45,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:01:45,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:46,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 12:01:46,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:46,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:01:46,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:46,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 12:01:46,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:46,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 12:01:46,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:46,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 12:01:46,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:46,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:01:46,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:46,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:01:46,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:46,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:01:46,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:46,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:01:46,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:46,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:01:46,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:46,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:01:46,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:46,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:01:46,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:46,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:01:46,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:46,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 12:01:46,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:46,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 12:01:46,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:46,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 12:01:46,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:46,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 12:01:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:46,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 12:01:46,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:46,318 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 12:01:46,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:01:46,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885080549] [2024-10-24 12:01:46,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885080549] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:01:46,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:01:46,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 12:01:46,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013015972] [2024-10-24 12:01:46,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:01:46,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 12:01:46,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:01:46,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 12:01:46,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 12:01:46,320 INFO L87 Difference]: Start difference. First operand 458 states and 648 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 12:01:46,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:01:46,758 INFO L93 Difference]: Finished difference Result 820 states and 1159 transitions. [2024-10-24 12:01:46,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 12:01:46,759 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 155 [2024-10-24 12:01:46,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:01:46,762 INFO L225 Difference]: With dead ends: 820 [2024-10-24 12:01:46,762 INFO L226 Difference]: Without dead ends: 514 [2024-10-24 12:01:46,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 12:01:46,764 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 304 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 12:01:46,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 588 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 12:01:46,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2024-10-24 12:01:46,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 458. [2024-10-24 12:01:46,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 409 states have (on average 1.3789731051344742) internal successors, (564), 410 states have internal predecessors, (564), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-24 12:01:46,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 646 transitions. [2024-10-24 12:01:46,831 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 646 transitions. Word has length 155 [2024-10-24 12:01:46,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:01:46,832 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 646 transitions. [2024-10-24 12:01:46,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 12:01:46,832 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 646 transitions. [2024-10-24 12:01:46,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-24 12:01:46,834 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:01:46,834 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 12:01:46,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 12:01:46,834 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:01:46,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:01:46,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1145147034, now seen corresponding path program 1 times [2024-10-24 12:01:46,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:01:46,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046838305] [2024-10-24 12:01:46,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:01:46,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:01:46,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:47,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 12:01:47,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:47,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:01:47,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:47,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 12:01:47,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:47,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 12:01:47,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:47,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 12:01:47,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:47,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:01:47,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:47,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:01:47,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:47,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:01:47,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:47,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:01:47,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:47,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:01:47,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:47,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:01:47,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:47,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:01:47,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:47,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:01:47,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:47,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 12:01:47,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:47,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 12:01:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:47,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 12:01:47,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:47,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 12:01:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:47,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 12:01:47,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:47,719 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 12:01:47,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:01:47,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046838305] [2024-10-24 12:01:47,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046838305] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:01:47,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:01:47,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 12:01:47,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069225627] [2024-10-24 12:01:47,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:01:47,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 12:01:47,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:01:47,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 12:01:47,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-24 12:01:47,722 INFO L87 Difference]: Start difference. First operand 458 states and 646 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-24 12:01:48,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:01:48,280 INFO L93 Difference]: Finished difference Result 854 states and 1204 transitions. [2024-10-24 12:01:48,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 12:01:48,281 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 155 [2024-10-24 12:01:48,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:01:48,284 INFO L225 Difference]: With dead ends: 854 [2024-10-24 12:01:48,285 INFO L226 Difference]: Without dead ends: 548 [2024-10-24 12:01:48,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-24 12:01:48,287 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 451 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 12:01:48,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 479 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 12:01:48,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2024-10-24 12:01:48,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 481. [2024-10-24 12:01:48,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 432 states have (on average 1.3842592592592593) internal successors, (598), 433 states have internal predecessors, (598), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-24 12:01:48,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 680 transitions. [2024-10-24 12:01:48,355 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 680 transitions. Word has length 155 [2024-10-24 12:01:48,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:01:48,355 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 680 transitions. [2024-10-24 12:01:48,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-24 12:01:48,356 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 680 transitions. [2024-10-24 12:01:48,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-24 12:01:48,358 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:01:48,358 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 12:01:48,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 12:01:48,359 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:01:48,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:01:48,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1561472360, now seen corresponding path program 1 times [2024-10-24 12:01:48,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:01:48,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435691839] [2024-10-24 12:01:48,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:01:48,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:01:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:48,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 12:01:48,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:48,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:01:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:48,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 12:01:48,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:48,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 12:01:49,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:49,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 12:01:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:49,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:01:49,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:49,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:01:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:49,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:01:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:49,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:01:49,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:49,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:01:49,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:49,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:01:49,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:49,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:01:49,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:49,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:01:49,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:49,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 12:01:49,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:49,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 12:01:49,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:49,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 12:01:49,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:49,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 12:01:49,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:49,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 12:01:49,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:49,046 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 12:01:49,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:01:49,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435691839] [2024-10-24 12:01:49,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435691839] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:01:49,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:01:49,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 12:01:49,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205522534] [2024-10-24 12:01:49,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:01:49,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 12:01:49,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:01:49,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 12:01:49,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-24 12:01:49,050 INFO L87 Difference]: Start difference. First operand 481 states and 680 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 12:01:49,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:01:49,634 INFO L93 Difference]: Finished difference Result 881 states and 1240 transitions. [2024-10-24 12:01:49,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 12:01:49,635 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 155 [2024-10-24 12:01:49,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:01:49,639 INFO L225 Difference]: With dead ends: 881 [2024-10-24 12:01:49,639 INFO L226 Difference]: Without dead ends: 552 [2024-10-24 12:01:49,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-10-24 12:01:49,641 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 304 mSDsluCounter, 1101 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 12:01:49,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 1318 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 12:01:49,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-24 12:01:49,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 481. [2024-10-24 12:01:49,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 432 states have (on average 1.3842592592592593) internal successors, (598), 433 states have internal predecessors, (598), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-24 12:01:49,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 680 transitions. [2024-10-24 12:01:49,712 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 680 transitions. Word has length 155 [2024-10-24 12:01:49,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:01:49,712 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 680 transitions. [2024-10-24 12:01:49,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 12:01:49,712 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 680 transitions. [2024-10-24 12:01:49,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-24 12:01:49,715 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:01:49,715 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 12:01:49,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 12:01:49,716 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:01:49,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:01:49,716 INFO L85 PathProgramCache]: Analyzing trace with hash 2139622423, now seen corresponding path program 1 times [2024-10-24 12:01:49,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:01:49,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365995628] [2024-10-24 12:01:49,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:01:49,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:01:49,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:49,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 12:01:49,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:49,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:01:49,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:49,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 12:01:49,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:49,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 12:01:49,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:49,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 12:01:49,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:49,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:01:49,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:49,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:01:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:49,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:01:49,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:49,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:01:49,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:49,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:01:49,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:49,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:01:49,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:49,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:01:49,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:49,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:01:49,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:49,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 12:01:49,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:49,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 12:01:49,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:49,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 12:01:49,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:49,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 12:01:49,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:49,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 12:01:49,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:49,882 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 12:01:49,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:01:49,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365995628] [2024-10-24 12:01:49,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365995628] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:01:49,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:01:49,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 12:01:49,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774385243] [2024-10-24 12:01:49,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:01:49,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:01:49,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:01:49,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:01:49,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:01:49,885 INFO L87 Difference]: Start difference. First operand 481 states and 680 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 12:01:50,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 12:01:50,059 INFO L93 Difference]: Finished difference Result 814 states and 1155 transitions. [2024-10-24 12:01:50,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 12:01:50,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 157 [2024-10-24 12:01:50,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 12:01:50,063 INFO L225 Difference]: With dead ends: 814 [2024-10-24 12:01:50,064 INFO L226 Difference]: Without dead ends: 485 [2024-10-24 12:01:50,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 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-24 12:01:50,065 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 2 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 12:01:50,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 483 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 12:01:50,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2024-10-24 12:01:50,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 485. [2024-10-24 12:01:50,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 436 states have (on average 1.3807339449541285) internal successors, (602), 437 states have internal predecessors, (602), 41 states have call successors, (41), 7 states have call predecessors, (41), 7 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-24 12:01:50,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 684 transitions. [2024-10-24 12:01:50,128 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 684 transitions. Word has length 157 [2024-10-24 12:01:50,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 12:01:50,128 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 684 transitions. [2024-10-24 12:01:50,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 12:01:50,129 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 684 transitions. [2024-10-24 12:01:50,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-24 12:01:50,130 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 12:01:50,130 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 12:01:50,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 12:01:50,131 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 12:01:50,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:01:50,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1453744999, now seen corresponding path program 1 times [2024-10-24 12:01:50,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:01:50,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044574337] [2024-10-24 12:01:50,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:01:50,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:01:50,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:52,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 12:01:52,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:52,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 12:01:52,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:52,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 12:01:52,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:52,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 12:01:52,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:52,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 12:01:52,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:52,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 12:01:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:52,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 12:01:52,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:52,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 12:01:52,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:52,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 12:01:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:52,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 12:01:52,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:52,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 12:01:52,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:52,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 12:01:52,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:52,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 12:01:52,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:52,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 12:01:52,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:52,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 12:01:52,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:52,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 12:01:52,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:52,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 12:01:52,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:52,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 12:01:52,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:52,401 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 27 proven. 24 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-10-24 12:01:52,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:01:52,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044574337] [2024-10-24 12:01:52,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044574337] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:01:52,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337218628] [2024-10-24 12:01:52,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:01:52,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:01:52,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:01:52,405 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 12:01:52,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 12:01:52,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:01:52,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-24 12:01:52,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:01:52,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-24 12:01:54,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 12:01:55,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-24 12:01:55,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-24 12:01:56,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-24 12:01:56,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-24 12:01:56,929 INFO L349 Elim1Store]: treesize reduction 362, result has 8.8 percent of original size [2024-10-24 12:01:56,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 872 treesize of output 550 [2024-10-24 12:01:57,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2024-10-24 12:01:57,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2024-10-24 12:01:57,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 12:01:57,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2024-10-24 12:01:58,187 INFO L349 Elim1Store]: treesize reduction 320, result has 30.0 percent of original size [2024-10-24 12:01:58,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 44 case distinctions, treesize of input 398 treesize of output 506 [2024-10-24 12:02:17,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 31 [2024-10-24 12:02:17,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 31