./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 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-84cfde4 [2024-10-11 14:01:25,274 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:01:25,333 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 14:01:25,337 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:01:25,338 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:01:25,367 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:01:25,367 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:01:25,379 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:01:25,380 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:01:25,380 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:01:25,380 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:01:25,381 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:01:25,381 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:01:25,381 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:01:25,381 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:01:25,382 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:01:25,382 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:01:25,382 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 14:01:25,382 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 14:01:25,383 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 14:01:25,383 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:01:25,386 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:01:25,386 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:01:25,387 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:01:25,387 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:01:25,387 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 14:01:25,387 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:01:25,387 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:01:25,387 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:01:25,388 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:01:25,388 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:01:25,388 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:01:25,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:01:25,388 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:01:25,388 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:01:25,389 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:01:25,389 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 14:01:25,389 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 14:01:25,389 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:01:25,390 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:01:25,391 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:01:25,391 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:01:25,391 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-clean/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-clean/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-11 14:01:25,640 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:01:25,670 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:01:25,676 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:01:25,677 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:01:25,677 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:01:25,678 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-11 14:01:27,053 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:01:27,228 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:01:27,229 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-63.i [2024-10-11 14:01:27,236 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d142b4a70/708cbef271fc4ee6b418092ad9dccaf5/FLAGd8795304f [2024-10-11 14:01:27,247 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d142b4a70/708cbef271fc4ee6b418092ad9dccaf5 [2024-10-11 14:01:27,249 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:01:27,250 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:01:27,251 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:01:27,252 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:01:27,257 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:01:27,258 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:01:27" (1/1) ... [2024-10-11 14:01:27,258 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2729bfe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:27, skipping insertion in model container [2024-10-11 14:01:27,259 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:01:27" (1/1) ... [2024-10-11 14:01:27,282 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:01:27,413 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-11 14:01:27,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:01:27,500 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:01:27,511 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-11 14:01:27,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:01:27,576 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:01:27,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:27 WrapperNode [2024-10-11 14:01:27,576 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:01:27,577 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:01:27,578 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:01:27,578 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:01:27,584 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:27" (1/1) ... [2024-10-11 14:01:27,601 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:27" (1/1) ... [2024-10-11 14:01:27,629 INFO L138 Inliner]: procedures = 29, calls = 204, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 677 [2024-10-11 14:01:27,629 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:01:27,630 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:01:27,630 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:01:27,630 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:01:27,640 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:27" (1/1) ... [2024-10-11 14:01:27,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:27" (1/1) ... [2024-10-11 14:01:27,645 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:27" (1/1) ... [2024-10-11 14:01:27,664 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-11 14:01:27,665 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:27" (1/1) ... [2024-10-11 14:01:27,665 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:27" (1/1) ... [2024-10-11 14:01:27,677 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:27" (1/1) ... [2024-10-11 14:01:27,685 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:27" (1/1) ... [2024-10-11 14:01:27,691 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:27" (1/1) ... [2024-10-11 14:01:27,693 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:27" (1/1) ... [2024-10-11 14:01:27,702 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:01:27,702 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:01:27,703 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:01:27,703 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:01:27,703 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:27" (1/1) ... [2024-10-11 14:01:27,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:01:27,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:01:27,728 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 14:01:27,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 14:01:27,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:01:27,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 14:01:27,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 14:01:27,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 14:01:27,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 14:01:27,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 14:01:27,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 14:01:27,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 14:01:27,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 14:01:27,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 14:01:27,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 14:01:27,776 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 14:01:27,776 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 14:01:27,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 14:01:27,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 14:01:27,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:01:27,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:01:27,922 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:01:27,923 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:01:28,331 INFO L? ?]: Removed 201 outVars from TransFormulas that were not future-live. [2024-10-11 14:01:28,331 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:01:28,381 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:01:28,381 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 14:01:28,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:01:28 BoogieIcfgContainer [2024-10-11 14:01:28,382 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:01:28,385 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:01:28,386 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:01:28,389 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:01:28,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:01:27" (1/3) ... [2024-10-11 14:01:28,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@744ade56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:01:28, skipping insertion in model container [2024-10-11 14:01:28,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:01:27" (2/3) ... [2024-10-11 14:01:28,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@744ade56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:01:28, skipping insertion in model container [2024-10-11 14:01:28,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:01:28" (3/3) ... [2024-10-11 14:01:28,393 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-63.i [2024-10-11 14:01:28,408 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:01:28,409 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 14:01:28,503 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:01:28,517 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;@101167d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:01:28,522 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 14:01:28,525 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-11 14:01:28,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 14:01:28,564 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:28,565 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-11 14:01:28,565 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:28,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:28,575 INFO L85 PathProgramCache]: Analyzing trace with hash -251190212, now seen corresponding path program 1 times [2024-10-11 14:01:28,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:28,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155969181] [2024-10-11 14:01:28,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:28,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:28,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:01:28,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:28,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 14:01:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:01:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 14:01:28,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:28,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:01:28,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:28,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:28,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:28,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:28,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:28,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:01:28,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:01:28,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:01:28,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:01:28,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 14:01:28,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,911 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-11 14:01:28,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:28,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155969181] [2024-10-11 14:01:28,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155969181] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:28,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:28,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:01:28,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130430469] [2024-10-11 14:01:28,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:28,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 14:01:28,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:28,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 14:01:28,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 14:01:28,948 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-11 14:01:29,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:29,004 INFO L93 Difference]: Finished difference Result 261 states and 412 transitions. [2024-10-11 14:01:29,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 14:01:29,007 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-11 14:01:29,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:29,014 INFO L225 Difference]: With dead ends: 261 [2024-10-11 14:01:29,014 INFO L226 Difference]: Without dead ends: 130 [2024-10-11 14:01:29,017 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-11 14:01:29,020 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-11 14:01:29,021 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-11 14:01:29,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-11 14:01:29,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-10-11 14:01:29,057 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-11 14:01:29,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 193 transitions. [2024-10-11 14:01:29,061 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 193 transitions. Word has length 151 [2024-10-11 14:01:29,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:29,062 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 193 transitions. [2024-10-11 14:01:29,062 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-11 14:01:29,062 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 193 transitions. [2024-10-11 14:01:29,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 14:01:29,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:29,064 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-11 14:01:29,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 14:01:29,065 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:29,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:29,065 INFO L85 PathProgramCache]: Analyzing trace with hash -380351792, now seen corresponding path program 1 times [2024-10-11 14:01:29,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:29,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285250338] [2024-10-11 14:01:29,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:29,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:29,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:01:29,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:29,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:29,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:29,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 14:01:29,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:29,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:01:29,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:29,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 14:01:29,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:29,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:29,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:29,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:01:29,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:29,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:29,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:29,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:29,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:29,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:29,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:29,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:29,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:29,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:29,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:29,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:29,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:01:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:29,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:01:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:29,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:01:29,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:29,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:01:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:29,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 14:01:29,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:29,520 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-11 14:01:29,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:29,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285250338] [2024-10-11 14:01:29,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285250338] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:29,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:29,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:01:29,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660594252] [2024-10-11 14:01:29,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:29,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:01:29,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:29,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:01:29,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:01:29,524 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-11 14:01:29,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:29,574 INFO L93 Difference]: Finished difference Result 261 states and 388 transitions. [2024-10-11 14:01:29,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:01:29,574 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-11 14:01:29,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:29,577 INFO L225 Difference]: With dead ends: 261 [2024-10-11 14:01:29,577 INFO L226 Difference]: Without dead ends: 132 [2024-10-11 14:01:29,578 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-11 14:01:29,579 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-11 14:01:29,580 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-11 14:01:29,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-11 14:01:29,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-10-11 14:01:29,590 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-11 14:01:29,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 195 transitions. [2024-10-11 14:01:29,592 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 195 transitions. Word has length 151 [2024-10-11 14:01:29,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:29,594 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 195 transitions. [2024-10-11 14:01:29,594 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-11 14:01:29,594 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 195 transitions. [2024-10-11 14:01:29,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-11 14:01:29,596 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:29,597 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-11 14:01:29,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 14:01:29,597 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:29,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:29,598 INFO L85 PathProgramCache]: Analyzing trace with hash -120686475, now seen corresponding path program 1 times [2024-10-11 14:01:29,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:29,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046192745] [2024-10-11 14:01:29,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:29,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:29,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:01:29,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:29,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:29,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 14:01:29,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:29,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:01:29,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:29,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 14:01:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:29,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:29,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:01:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:29,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:29,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:29,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:29,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:29,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:29,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:29,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:29,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:29,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:29,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:29,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:29,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:01:29,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:29,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:01:29,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:29,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:01:29,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:29,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:01:29,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:29,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 14:01:29,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:29,791 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-11 14:01:29,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:29,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046192745] [2024-10-11 14:01:29,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046192745] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:29,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:29,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:01:29,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520879861] [2024-10-11 14:01:29,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:29,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:01:29,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:29,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:01:29,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:01:29,794 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-11 14:01:29,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:29,829 INFO L93 Difference]: Finished difference Result 266 states and 393 transitions. [2024-10-11 14:01:29,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:01:29,830 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-11 14:01:29,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:29,831 INFO L225 Difference]: With dead ends: 266 [2024-10-11 14:01:29,831 INFO L226 Difference]: Without dead ends: 135 [2024-10-11 14:01:29,832 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-11 14:01:29,833 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-11 14:01:29,833 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-11 14:01:29,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-11 14:01:29,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2024-10-11 14:01:29,841 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-11 14:01:29,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 197 transitions. [2024-10-11 14:01:29,842 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 197 transitions. Word has length 153 [2024-10-11 14:01:29,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:29,843 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 197 transitions. [2024-10-11 14:01:29,843 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-11 14:01:29,843 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 197 transitions. [2024-10-11 14:01:29,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-11 14:01:29,845 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:29,845 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-11 14:01:29,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 14:01:29,845 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:29,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:29,846 INFO L85 PathProgramCache]: Analyzing trace with hash 137478963, now seen corresponding path program 1 times [2024-10-11 14:01:29,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:29,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840400159] [2024-10-11 14:01:29,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:29,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:29,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:01:29,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:29,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:29,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:29,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 14:01:29,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:29,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:01:29,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:29,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 14:01:29,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:29,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:29,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:29,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:01:29,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:29,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:30,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:30,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:30,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:30,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:30,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:30,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:01:30,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:01:30,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:01:30,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:01:30,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 14:01:30,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,035 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-11 14:01:30,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:30,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840400159] [2024-10-11 14:01:30,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840400159] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:30,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:30,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:01:30,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497381027] [2024-10-11 14:01:30,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:30,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:01:30,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:30,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:01:30,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:01:30,040 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-11 14:01:30,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:30,089 INFO L93 Difference]: Finished difference Result 270 states and 397 transitions. [2024-10-11 14:01:30,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:01:30,090 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-11 14:01:30,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:30,094 INFO L225 Difference]: With dead ends: 270 [2024-10-11 14:01:30,095 INFO L226 Difference]: Without dead ends: 137 [2024-10-11 14:01:30,096 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-11 14:01:30,099 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-11 14:01:30,100 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-11 14:01:30,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-11 14:01:30,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2024-10-11 14:01:30,112 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-11 14:01:30,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 199 transitions. [2024-10-11 14:01:30,113 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 199 transitions. Word has length 153 [2024-10-11 14:01:30,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:30,114 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 199 transitions. [2024-10-11 14:01:30,114 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-11 14:01:30,114 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 199 transitions. [2024-10-11 14:01:30,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-11 14:01:30,115 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:30,117 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-11 14:01:30,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 14:01:30,117 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:30,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:30,118 INFO L85 PathProgramCache]: Analyzing trace with hash -671867663, now seen corresponding path program 1 times [2024-10-11 14:01:30,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:30,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302202806] [2024-10-11 14:01:30,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:30,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:30,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:01:30,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 14:01:30,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:01:30,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 14:01:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:30,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:01:30,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:30,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:30,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:30,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:30,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:30,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:01:30,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:01:30,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:01:30,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:01:30,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 14:01:30,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,316 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-11 14:01:30,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:30,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302202806] [2024-10-11 14:01:30,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302202806] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:30,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:30,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:01:30,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042393358] [2024-10-11 14:01:30,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:30,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:01:30,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:30,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:01:30,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:01:30,322 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-11 14:01:30,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:30,363 INFO L93 Difference]: Finished difference Result 274 states and 401 transitions. [2024-10-11 14:01:30,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:01:30,364 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-11 14:01:30,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:30,368 INFO L225 Difference]: With dead ends: 274 [2024-10-11 14:01:30,368 INFO L226 Difference]: Without dead ends: 139 [2024-10-11 14:01:30,369 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-11 14:01:30,374 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-11 14:01:30,374 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-11 14:01:30,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-10-11 14:01:30,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2024-10-11 14:01:30,384 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-11 14:01:30,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 201 transitions. [2024-10-11 14:01:30,386 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 201 transitions. Word has length 153 [2024-10-11 14:01:30,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:30,387 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 201 transitions. [2024-10-11 14:01:30,388 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-11 14:01:30,388 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 201 transitions. [2024-10-11 14:01:30,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-11 14:01:30,391 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:30,391 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-11 14:01:30,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 14:01:30,392 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:30,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:30,392 INFO L85 PathProgramCache]: Analyzing trace with hash -614609361, now seen corresponding path program 1 times [2024-10-11 14:01:30,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:30,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172600697] [2024-10-11 14:01:30,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:30,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:30,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:01:30,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:30,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 14:01:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:01:30,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 14:01:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:30,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:01:30,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:30,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:30,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:30,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:30,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:30,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:30,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:01:30,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:01:30,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:01:30,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:01:30,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 14:01:30,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,609 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-11 14:01:30,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:30,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172600697] [2024-10-11 14:01:30,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172600697] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:30,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:30,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:01:30,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653790472] [2024-10-11 14:01:30,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:30,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:01:30,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:30,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:01:30,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:01:30,615 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-11 14:01:30,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:30,653 INFO L93 Difference]: Finished difference Result 278 states and 405 transitions. [2024-10-11 14:01:30,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:01:30,654 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-11 14:01:30,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:30,655 INFO L225 Difference]: With dead ends: 278 [2024-10-11 14:01:30,656 INFO L226 Difference]: Without dead ends: 141 [2024-10-11 14:01:30,656 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-11 14:01:30,657 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-11 14:01:30,658 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-11 14:01:30,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-10-11 14:01:30,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2024-10-11 14:01:30,668 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-11 14:01:30,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 203 transitions. [2024-10-11 14:01:30,669 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 203 transitions. Word has length 153 [2024-10-11 14:01:30,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:30,669 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 203 transitions. [2024-10-11 14:01:30,670 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-11 14:01:30,670 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 203 transitions. [2024-10-11 14:01:30,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-11 14:01:30,671 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:30,671 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-11 14:01:30,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 14:01:30,671 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:30,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:30,672 INFO L85 PathProgramCache]: Analyzing trace with hash -614549779, now seen corresponding path program 1 times [2024-10-11 14:01:30,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:30,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930351677] [2024-10-11 14:01:30,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:30,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:33,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:01:33,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:33,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:33,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 14:01:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:33,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:01:33,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:33,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 14:01:33,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:33,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:33,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:01:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:33,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:33,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:33,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:33,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:33,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:33,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:33,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:33,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:33,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:33,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:33,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:33,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:01:33,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:33,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:01:33,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:33,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:01:33,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:33,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:01:33,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:33,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 14:01:33,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:33,468 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-11 14:01:33,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:33,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930351677] [2024-10-11 14:01:33,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930351677] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:01:33,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561777052] [2024-10-11 14:01:33,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:33,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:01:33,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:01:33,470 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:01:33,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 14:01:33,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:33,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-10-11 14:01:33,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:01:35,121 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-11 14:01:35,745 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-11 14:01:36,099 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-11 14:01:36,621 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-11 14:01:37,065 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-11 14:01:37,457 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-11 14:01:37,837 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-11 14:01:38,240 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-11 14:01:38,600 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-11 14:01:38,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,607 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-11 14:01:38,616 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-11 14:01:38,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,624 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-11 14:01:38,648 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-11 14:01:38,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,664 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-11 14:01:38,680 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-11 14:01:38,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,708 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-11 14:01:38,730 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-11 14:01:38,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,738 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-11 14:01:38,747 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-11 14:01:38,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,755 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-11 14:01:38,770 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-11 14:01:38,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,777 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-11 14:01:38,787 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-11 14:01:38,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,798 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-11 14:01:38,808 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-11 14:01:38,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,818 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-11 14:01:38,828 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-11 14:01:38,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,847 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-11 14:01:38,857 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-11 14:01:38,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,863 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-11 14:01:38,870 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-11 14:01:38,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,879 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-11 14:01:38,892 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-11 14:01:38,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,903 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-11 14:01:38,913 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-11 14:01:38,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,922 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-11 14:01:38,932 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-11 14:01:38,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,945 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-11 14:01:38,955 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-11 14:01:38,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,966 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-11 14:01:38,979 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-11 14:01:38,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:38,996 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-11 14:01:39,008 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-11 14:01:39,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:39,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:39,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:39,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:39,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:39,022 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-11 14:01:39,042 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-11 14:01:39,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:39,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:39,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:39,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:39,050 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-11 14:01:39,062 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-11 14:01:39,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:39,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:39,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:39,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:39,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:39,077 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-11 14:01:39,090 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-11 14:01:39,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:39,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:39,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:39,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:39,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:39,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:39,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:39,129 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-11 14:01:39,140 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-11 14:01:39,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:39,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:39,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:39,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:39,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:39,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:39,156 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-11 14:01:39,169 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-11 14:01:39,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:39,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:39,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:39,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:39,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:39,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:39,181 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-11 14:01:39,191 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-11 14:01:39,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:39,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:39,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:39,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:39,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:39,207 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-11 14:01:39,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:39,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:39,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:39,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:01:39,487 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 14:01:39,487 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-11 14:01:39,689 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-11 14:01:39,689 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:01:39,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561777052] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:01:39,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 14:01:39,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 21 [2024-10-11 14:01:39,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211139790] [2024-10-11 14:01:39,888 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 14:01:39,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 14:01:39,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:39,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 14:01:39,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2024-10-11 14:01:39,892 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-11 14:01:42,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:42,901 INFO L93 Difference]: Finished difference Result 513 states and 727 transitions. [2024-10-11 14:01:42,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-11 14:01:42,902 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-11 14:01:42,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:42,904 INFO L225 Difference]: With dead ends: 513 [2024-10-11 14:01:42,904 INFO L226 Difference]: Without dead ends: 374 [2024-10-11 14:01:42,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 220 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=462, Invalid=1700, Unknown=0, NotChecked=0, Total=2162 [2024-10-11 14:01:42,907 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 1591 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 1621 mSolverCounterSat, 190 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1594 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 1812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 1621 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:42,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1594 Valid, 945 Invalid, 1812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 1621 Invalid, 1 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 14:01:42,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-10-11 14:01:42,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 244. [2024-10-11 14:01:42,927 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-11 14:01:42,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 347 transitions. [2024-10-11 14:01:42,929 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 347 transitions. Word has length 153 [2024-10-11 14:01:42,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:42,930 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 347 transitions. [2024-10-11 14:01:42,931 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-11 14:01:42,931 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 347 transitions. [2024-10-11 14:01:42,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-11 14:01:42,932 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:42,932 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-11 14:01:42,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 14:01:43,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:01:43,134 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:43,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:43,134 INFO L85 PathProgramCache]: Analyzing trace with hash 2092069615, now seen corresponding path program 1 times [2024-10-11 14:01:43,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:43,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098919188] [2024-10-11 14:01:43,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:43,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:43,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:44,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:01:44,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:44,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:44,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:44,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 14:01:44,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:44,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:01:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:44,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 14:01:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:44,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:44,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:44,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:01:44,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:44,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:44,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:44,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:44,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:44,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:44,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:44,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:44,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:44,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:44,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:44,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:44,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:44,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:01:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:44,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:01:44,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:44,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:01:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:44,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:01:44,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:44,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 14:01:44,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:44,846 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-11 14:01:44,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:44,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098919188] [2024-10-11 14:01:44,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098919188] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:44,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:44,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 14:01:44,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716188017] [2024-10-11 14:01:44,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:44,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 14:01:44,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:44,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 14:01:44,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-10-11 14:01:44,848 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-11 14:01:45,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:45,381 INFO L93 Difference]: Finished difference Result 632 states and 898 transitions. [2024-10-11 14:01:45,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 14:01:45,382 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-11 14:01:45,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:45,386 INFO L225 Difference]: With dead ends: 632 [2024-10-11 14:01:45,386 INFO L226 Difference]: Without dead ends: 389 [2024-10-11 14:01:45,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2024-10-11 14:01:45,387 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 379 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:45,388 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.4s Time] [2024-10-11 14:01:45,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-10-11 14:01:45,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 379. [2024-10-11 14:01:45,431 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-11 14:01:45,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 539 transitions. [2024-10-11 14:01:45,435 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 539 transitions. Word has length 153 [2024-10-11 14:01:45,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:45,436 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 539 transitions. [2024-10-11 14:01:45,436 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-11 14:01:45,436 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 539 transitions. [2024-10-11 14:01:45,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 14:01:45,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:45,437 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-11 14:01:45,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 14:01:45,438 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:45,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:45,438 INFO L85 PathProgramCache]: Analyzing trace with hash -280328362, now seen corresponding path program 1 times [2024-10-11 14:01:45,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:45,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992087857] [2024-10-11 14:01:45,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:45,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:45,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:47,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:01:47,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:47,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:47,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 14:01:47,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:47,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:01:47,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:47,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 14:01:47,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:47,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:47,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:47,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:01:47,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:47,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:47,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:47,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:47,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:47,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:47,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:47,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:47,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:47,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:47,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:47,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:47,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:47,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:01:47,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:47,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:01:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:47,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:01:47,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:47,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:01:47,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:47,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 14:01:47,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:47,553 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-11 14:01:47,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:47,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992087857] [2024-10-11 14:01:47,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992087857] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:47,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:47,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 14:01:47,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266436675] [2024-10-11 14:01:47,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:47,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 14:01:47,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:47,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 14:01:47,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-11 14:01:47,556 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-11 14:01:48,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:48,222 INFO L93 Difference]: Finished difference Result 768 states and 1091 transitions. [2024-10-11 14:01:48,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 14:01:48,224 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-11 14:01:48,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:48,227 INFO L225 Difference]: With dead ends: 768 [2024-10-11 14:01:48,227 INFO L226 Difference]: Without dead ends: 390 [2024-10-11 14:01:48,228 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-11 14:01:48,231 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-11 14:01:48,231 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-11 14:01:48,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-10-11 14:01:48,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 383. [2024-10-11 14:01:48,271 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-11 14:01:48,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 543 transitions. [2024-10-11 14:01:48,273 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 543 transitions. Word has length 155 [2024-10-11 14:01:48,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:48,273 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 543 transitions. [2024-10-11 14:01:48,273 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-11 14:01:48,273 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 543 transitions. [2024-10-11 14:01:48,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 14:01:48,274 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:48,275 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-11 14:01:48,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 14:01:48,275 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:48,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:48,275 INFO L85 PathProgramCache]: Analyzing trace with hash -22162924, now seen corresponding path program 1 times [2024-10-11 14:01:48,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:48,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691323207] [2024-10-11 14:01:48,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:48,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:48,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:48,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:01:48,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:48,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:48,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:48,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 14:01:48,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:48,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:01:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:48,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 14:01:48,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:48,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:48,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:48,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:01:48,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:48,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:48,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:48,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:48,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:48,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:48,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:48,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:48,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:48,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:48,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:48,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:48,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:01:48,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:48,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:01:48,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:48,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:01:48,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:48,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:01:48,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:48,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 14:01:48,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:48,592 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-11 14:01:48,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:48,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691323207] [2024-10-11 14:01:48,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691323207] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:48,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:48,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 14:01:48,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6701392] [2024-10-11 14:01:48,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:48,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 14:01:48,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:48,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 14:01:48,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 14:01:48,594 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-11 14:01:48,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:48,957 INFO L93 Difference]: Finished difference Result 932 states and 1314 transitions. [2024-10-11 14:01:48,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 14:01:48,957 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-11 14:01:48,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:48,961 INFO L225 Difference]: With dead ends: 932 [2024-10-11 14:01:48,961 INFO L226 Difference]: Without dead ends: 550 [2024-10-11 14:01:48,962 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-11 14:01:48,963 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 268 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:48,963 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.3s Time] [2024-10-11 14:01:48,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2024-10-11 14:01:49,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 429. [2024-10-11 14:01:49,017 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-11 14:01:49,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 604 transitions. [2024-10-11 14:01:49,018 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 604 transitions. Word has length 155 [2024-10-11 14:01:49,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:49,021 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 604 transitions. [2024-10-11 14:01:49,021 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-11 14:01:49,021 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 604 transitions. [2024-10-11 14:01:49,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 14:01:49,022 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:49,022 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-11 14:01:49,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 14:01:49,022 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:49,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:49,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1167779288, now seen corresponding path program 1 times [2024-10-11 14:01:49,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:49,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643788939] [2024-10-11 14:01:49,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:49,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:49,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:50,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:01:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:50,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:50,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:50,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 14:01:50,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:50,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:01:50,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:50,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 14:01:50,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:50,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:50,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:50,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:01:50,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:50,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:50,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:50,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:50,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:50,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:50,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:50,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:50,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:50,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:50,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:50,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:50,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:50,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:01:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:50,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:01:50,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:50,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:01:50,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:50,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:01:50,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:50,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 14:01:50,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:50,096 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-11 14:01:50,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:50,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643788939] [2024-10-11 14:01:50,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643788939] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:50,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:50,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 14:01:50,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112728433] [2024-10-11 14:01:50,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:50,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 14:01:50,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:50,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 14:01:50,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 14:01:50,098 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-11 14:01:50,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:50,989 INFO L93 Difference]: Finished difference Result 812 states and 1142 transitions. [2024-10-11 14:01:50,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 14:01:50,989 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-11 14:01:50,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:50,991 INFO L225 Difference]: With dead ends: 812 [2024-10-11 14:01:50,991 INFO L226 Difference]: Without dead ends: 535 [2024-10-11 14:01:50,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2024-10-11 14:01:50,992 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 521 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 1110 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.6s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:50,992 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.6s Time] [2024-10-11 14:01:50,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-10-11 14:01:51,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 458. [2024-10-11 14:01:51,035 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-11 14:01:51,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 648 transitions. [2024-10-11 14:01:51,037 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 648 transitions. Word has length 155 [2024-10-11 14:01:51,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:51,037 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 648 transitions. [2024-10-11 14:01:51,037 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-11 14:01:51,037 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 648 transitions. [2024-10-11 14:01:51,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 14:01:51,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:51,040 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-11 14:01:51,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 14:01:51,040 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:51,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:51,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1538840106, now seen corresponding path program 1 times [2024-10-11 14:01:51,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:51,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828863438] [2024-10-11 14:01:51,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:51,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:51,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:51,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:01:51,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:51,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:51,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:51,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 14:01:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:51,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:01:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:51,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 14:01:51,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:51,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:51,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:51,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:01:51,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:51,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:51,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:51,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:51,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:51,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:51,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:51,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:51,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:51,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:51,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:51,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:01:51,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:51,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:01:51,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:51,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:01:51,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:51,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:01:51,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:51,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 14:01:51,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:51,521 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-11 14:01:51,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:51,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828863438] [2024-10-11 14:01:51,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828863438] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:51,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:51,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 14:01:51,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8215607] [2024-10-11 14:01:51,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:51,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 14:01:51,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:51,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 14:01:51,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 14:01:51,523 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-11 14:01:51,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:51,846 INFO L93 Difference]: Finished difference Result 820 states and 1159 transitions. [2024-10-11 14:01:51,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:01:51,846 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-11 14:01:51,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:51,848 INFO L225 Difference]: With dead ends: 820 [2024-10-11 14:01:51,848 INFO L226 Difference]: Without dead ends: 514 [2024-10-11 14:01:51,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 14:01:51,849 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 304 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-11 14:01:51,849 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-11 14:01:51,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2024-10-11 14:01:51,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 458. [2024-10-11 14:01:51,885 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-11 14:01:51,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 646 transitions. [2024-10-11 14:01:51,887 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 646 transitions. Word has length 155 [2024-10-11 14:01:51,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:51,887 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 646 transitions. [2024-10-11 14:01:51,887 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-11 14:01:51,887 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 646 transitions. [2024-10-11 14:01:51,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 14:01:51,888 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:51,888 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-11 14:01:51,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 14:01:51,888 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:51,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:51,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1145147034, now seen corresponding path program 1 times [2024-10-11 14:01:51,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:51,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815735303] [2024-10-11 14:01:51,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:51,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:51,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:52,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:01:52,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:52,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:52,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:52,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 14:01:52,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:52,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:01:52,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:52,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 14:01:52,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:52,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:52,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:52,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:01:52,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:52,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:52,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:52,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:52,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:52,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:52,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:52,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:52,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:52,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:52,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:52,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:52,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:01:52,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:52,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:01:52,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:52,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:01:52,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:52,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:01:52,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:52,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 14:01:52,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:52,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-11 14:01:52,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:52,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815735303] [2024-10-11 14:01:52,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815735303] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:52,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:52,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 14:01:52,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549064673] [2024-10-11 14:01:52,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:52,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 14:01:52,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:52,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 14:01:52,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 14:01:52,609 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-11 14:01:53,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:53,016 INFO L93 Difference]: Finished difference Result 854 states and 1204 transitions. [2024-10-11 14:01:53,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 14:01:53,016 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-11 14:01:53,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:53,018 INFO L225 Difference]: With dead ends: 854 [2024-10-11 14:01:53,018 INFO L226 Difference]: Without dead ends: 548 [2024-10-11 14:01:53,019 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-11 14:01:53,019 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.3s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:53,019 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.3s Time] [2024-10-11 14:01:53,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2024-10-11 14:01:53,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 481. [2024-10-11 14:01:53,055 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-11 14:01:53,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 680 transitions. [2024-10-11 14:01:53,056 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 680 transitions. Word has length 155 [2024-10-11 14:01:53,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:53,056 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 680 transitions. [2024-10-11 14:01:53,056 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-11 14:01:53,057 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 680 transitions. [2024-10-11 14:01:53,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-11 14:01:53,057 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:53,057 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-11 14:01:53,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 14:01:53,058 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:53,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:53,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1561472360, now seen corresponding path program 1 times [2024-10-11 14:01:53,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:53,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9728599] [2024-10-11 14:01:53,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:53,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:53,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:53,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:01:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:53,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:53,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:53,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 14:01:53,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:53,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:01:53,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:53,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 14:01:53,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:53,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:53,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:53,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:01:53,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:53,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:53,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:53,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:53,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:53,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:53,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:53,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:53,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:53,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:53,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:53,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:53,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:53,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:01:53,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:53,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:01:53,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:53,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:01:53,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:53,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:01:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:53,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 14:01:53,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:53,631 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-11 14:01:53,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:53,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9728599] [2024-10-11 14:01:53,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9728599] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:53,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:53,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 14:01:53,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307817933] [2024-10-11 14:01:53,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:53,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 14:01:53,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:53,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 14:01:53,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 14:01:53,632 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-11 14:01:54,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:54,070 INFO L93 Difference]: Finished difference Result 881 states and 1240 transitions. [2024-10-11 14:01:54,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 14:01:54,070 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-11 14:01:54,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:54,072 INFO L225 Difference]: With dead ends: 881 [2024-10-11 14:01:54,072 INFO L226 Difference]: Without dead ends: 552 [2024-10-11 14:01:54,073 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-11 14:01:54,073 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 304 mSDsluCounter, 1101 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:54,073 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.3s Time] [2024-10-11 14:01:54,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-10-11 14:01:54,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 481. [2024-10-11 14:01:54,108 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-11 14:01:54,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 680 transitions. [2024-10-11 14:01:54,110 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 680 transitions. Word has length 155 [2024-10-11 14:01:54,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:54,110 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 680 transitions. [2024-10-11 14:01:54,110 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-11 14:01:54,110 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 680 transitions. [2024-10-11 14:01:54,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-11 14:01:54,111 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:54,111 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-11 14:01:54,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 14:01:54,111 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:54,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:54,112 INFO L85 PathProgramCache]: Analyzing trace with hash 2139622423, now seen corresponding path program 1 times [2024-10-11 14:01:54,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:54,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882570465] [2024-10-11 14:01:54,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:54,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:54,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:54,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:01:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:54,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:54,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:54,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 14:01:54,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:54,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:01:54,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:54,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 14:01:54,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:54,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:54,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:54,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:01:54,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:54,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:54,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:54,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:54,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:54,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:54,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:54,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:54,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:54,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:54,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:54,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:54,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:54,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:01:54,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:54,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:01:54,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:54,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:01:54,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:54,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:01:54,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:54,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 14:01:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:54,185 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-11 14:01:54,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:54,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882570465] [2024-10-11 14:01:54,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882570465] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:54,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:54,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:01:54,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231841447] [2024-10-11 14:01:54,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:54,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:01:54,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:54,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:01:54,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:01:54,187 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-11 14:01:54,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:54,327 INFO L93 Difference]: Finished difference Result 814 states and 1155 transitions. [2024-10-11 14:01:54,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:01:54,330 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-11 14:01:54,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:54,332 INFO L225 Difference]: With dead ends: 814 [2024-10-11 14:01:54,335 INFO L226 Difference]: Without dead ends: 485 [2024-10-11 14:01:54,336 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-11 14:01:54,336 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-11 14:01:54,336 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-11 14:01:54,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2024-10-11 14:01:54,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 485. [2024-10-11 14:01:54,383 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-11 14:01:54,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 684 transitions. [2024-10-11 14:01:54,385 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 684 transitions. Word has length 157 [2024-10-11 14:01:54,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:54,385 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 684 transitions. [2024-10-11 14:01:54,386 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-11 14:01:54,386 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 684 transitions. [2024-10-11 14:01:54,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-11 14:01:54,387 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:54,387 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-11 14:01:54,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 14:01:54,387 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:54,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:54,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1453744999, now seen corresponding path program 1 times [2024-10-11 14:01:54,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:54,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971219551] [2024-10-11 14:01:54,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:54,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:54,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:56,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:01:56,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:56,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:56,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:56,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 14:01:56,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:56,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 14:01:56,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:56,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 14:01:56,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:56,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:56,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:56,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:01:56,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:56,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:01:56,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:56,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:56,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:56,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:56,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:56,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:56,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:56,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:56,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:56,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:56,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:56,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:01:56,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:56,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:01:56,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:56,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:01:56,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:56,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:01:56,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:56,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 14:01:56,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:56,233 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-11 14:01:56,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:56,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971219551] [2024-10-11 14:01:56,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971219551] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:01:56,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502300651] [2024-10-11 14:01:56,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:56,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:01:56,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:01:56,235 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:01:56,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 14:01:56,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:56,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-11 14:01:56,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:01:56,549 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-11 14:01:58,013 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-11 14:01:58,360 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-11 14:01:58,664 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-11 14:01:58,983 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-11 14:01:59,355 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-11 14:01:59,698 INFO L349 Elim1Store]: treesize reduction 362, result has 8.8 percent of original size [2024-10-11 14:01:59,698 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-11 14:01:59,944 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-11 14:01:59,997 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-11 14:02:00,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:00,012 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-11 14:02:00,599 INFO L349 Elim1Store]: treesize reduction 320, result has 30.0 percent of original size [2024-10-11 14:02:00,599 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-11 14:02:17,282 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-11 14:02:17,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 42 treesize of output 31 [2024-10-11 14:02:18,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:18,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:18,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:18,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:18,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:18,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:18,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:18,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:18,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:18,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:18,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:18,556 INFO L349 Elim1Store]: treesize reduction 581, result has 3.0 percent of original size [2024-10-11 14:02:18,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 6 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 11 new quantified variables, introduced 11 case distinctions, treesize of input 5751 treesize of output 2796 [2024-10-11 14:02:18,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:18,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:18,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:18,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:18,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:18,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:18,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:18,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:18,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:18,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:18,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:18,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:18,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 5 select indices, 5 select index equivalence classes, 17 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 310 [2024-10-11 14:02:19,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 310 [2024-10-11 14:02:19,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 310 [2024-10-11 14:02:19,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 219 [2024-10-11 14:02:19,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 219 [2024-10-11 14:02:19,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 127 [2024-10-11 14:02:19,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:19,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 127 [2024-10-11 14:02:21,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:21,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:21,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:21,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:21,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:21,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:21,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:21,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:21,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:21,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:21,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:21,235 INFO L349 Elim1Store]: treesize reduction 581, result has 3.0 percent of original size [2024-10-11 14:02:21,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 6 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 11 new quantified variables, introduced 11 case distinctions, treesize of input 1536 treesize of output 1227 [2024-10-11 14:02:22,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:22,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:22,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:22,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:22,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:23,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:23,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:23,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:23,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:23,078 INFO L349 Elim1Store]: treesize reduction 209, result has 7.9 percent of original size [2024-10-11 14:02:23,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 10814 treesize of output 10739 [2024-10-11 14:02:23,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:23,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:23,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:23,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:23,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 29 [2024-10-11 14:02:23,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:23,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:23,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:23,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:23,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:23,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:23,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:23,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:23,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:23,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:23,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:23,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 293 [2024-10-11 14:02:23,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:23,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:23,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:23,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:23,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:23,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:23,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 76 [2024-10-11 14:02:23,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:23,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:23,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:23,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:23,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:23,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:23,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:23,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:23,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:23,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:23,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:24,137 INFO L349 Elim1Store]: treesize reduction 1146, result has 2.6 percent of original size [2024-10-11 14:02:24,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 6 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 13 new quantified variables, introduced 23 case distinctions, treesize of input 7035 treesize of output 3064 [2024-10-11 14:02:27,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,306 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 14:02:27,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 83 [2024-10-11 14:02:27,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 83 [2024-10-11 14:02:27,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 83 [2024-10-11 14:02:27,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 135 [2024-10-11 14:02:27,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 140 [2024-10-11 14:02:27,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 83 [2024-10-11 14:02:27,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:27,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 83 [2024-10-11 14:02:30,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:30,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:30,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:30,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:30,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:30,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:30,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:30,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:30,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:30,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:30,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:30,748 INFO L349 Elim1Store]: treesize reduction 358, result has 16.6 percent of original size [2024-10-11 14:02:30,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 13 case distinctions, treesize of input 3122 treesize of output 3203 [2024-10-11 14:02:31,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:31,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:31,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:31,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:31,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:31,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:31,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:31,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:31,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:31,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:31,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:31,277 INFO L349 Elim1Store]: treesize reduction 672, result has 13.1 percent of original size [2024-10-11 14:02:31,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 19 case distinctions, treesize of input 6987 treesize of output 6422 [2024-10-11 14:02:33,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:33,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:33,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:33,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:33,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 66 treesize of output 33 [2024-10-11 14:02:33,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:33,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:33,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:33,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:33,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:33,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:33,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:33,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:33,564 INFO L349 Elim1Store]: treesize reduction 698, result has 24.2 percent of original size [2024-10-11 14:02:33,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 8 select indices, 8 select index equivalence classes, 10 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 30 case distinctions, treesize of input 205 treesize of output 388